Data Structure Set 1
On This Page
This set of Data Structure DS Multiple Choice Questions & Answers (MCQs) focuses on Data Structure Set 1
Q1 | Which if the following is/are the levels of implementation of data structure
- abstract level
- application level
- implementation level
- all of the above
Q2 | A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……
- avl tree
- red-black tree
- lemma tree
- none of the above
Q3 | Stack is also called as
- last in first out
- first in last out
- last in last out
- first in first out
Q4 | …………… is not the component of data structure.
- operations
- storage structures
- algorithms
- none of above
Q5 | Which of the following is not the part of ADT description?
- data
- operations
- both of the above
- none of the above
Q6 | ……………. Is a pile in which items are added at one end and removed from the other.
- stack
- queue
- list
- none of the above
Q7 | ………… is very useful in situation when data have to stored and then retrieved in reverse order.
- stack
- queue
- list
- link list
Q8 | Which data structure allows deleting data elements from and inserting at rear?
- stacks
- queues
- dequeues
- binary search tree
Q9 | Which of the following data structure can’t store the non-homogeneous data elements?
- arrays
- records
- pointers
- stacks
Q10 | A ……. is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
- queue linked list
- stacks linked list
- both of them
- neither of them
Q11 | Which of the following is non-liner data structure?
- stacks
- list
- strings
- trees
Q12 | Herder node is used as sentinel in …..
- graphs
- stacks
- binary tree
- queues
Q13 | Which data structure is used in breadth first search of a graph to hold nodes?
- stack
- queue
- tree
- array
Q14 | Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
- input restricted dequeue
- output restricted qequeue
- priority queues
- stack
Q15 | Which of the following data structure is non linear type?
- strings
- lists
- stacks
- graph
Q16 | Which of the following data structure is linear type?
- graph
- trees
- binary tree
- stack
Q17 | To represent hierarchical relationship between elements, Which data structure is suitable?
- dequeue
- priority
- tree
- graph
Q18 | A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.
- weakly connected
- strongly connected
- tightly connected
- linearly connected
Q19 | In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex.
- depth first
- breadth first
- with first
- depth limited
Q20 | The number of comparisons done by sequential search is ………………
- (n/2)+1
- (n+1)/2
- (n-1)/2
- (n+2)/2
Q21 | In ……………, search start at the beginning of the list and check every element in the list.
- linear search
- binary search
- hash search
- binary tree search
Q22 | Which of the following is not the internal sort?
- insertion sort
- bubble sort
- merge sort
- heap sort
Q23 | A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.
- partite
- bipartite
- rooted
- bisects
Q24 | In a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively.
- 0 and 1
- 0 and -1
- -1 and 0
- 1 and 0
Q25 | In a circular queue the value of r will be ..
- r=r+1
- r=(r+1)% [queue_size – 1]
- r=(r+1)% queue_size
- r=(r-1)% queue_size