LIFO
FIFO
FILO

Which of the following data structures can handle updates and queries in log(n) time on an array
Stack
Queue
Array
Segment Tree

Which of the following is non-liner data structure
Stacks
Strings
Queue
Graph

To represent hierarchical relationship between elements, Which data structure is suitable
Dequeue
Priority
Graph
n2 spanning trees

Which of the following data structure can't store the non-homogeneous data elements
Array
Record
Pointers
Stacks

…………… is not the component of data structure
Operations
Storage Structures
Algorithms
None of above

With what data structure can a priority queue be implemented
Array
List
Heap
All of the mentioned

The Data structure used in standard implementation of Breadth First Search
Stack
Queue
Linked List
none of the mentioned

In Breadth first search graph, which of the following data structure is used
Queue
Stack
Linked List
None

What is data Structure
Database
Algorithm
Programming language
Cryptography

- Try Automation
- About
- Signup for Free