Top 350+ Solved Data Structure and Algorithms (DSA) MCQ Questions Answer
Q. The situation when in a linked list START=NULL is
a. Underflow
b. Overflow
c. Housefull
d. Saturated
Q. The following is two-way list
a. Grounded header list
b. Circular header list
c. Linked list with header and trailer nodes
d. None of above
Q. The following name does not relate to stacks
a. FIFO lists
b. LIFO list
c. Piles
d. Push-down lists
Q. In a graph if e=(u, v) means
a. e begins at u and ends at v
b. u is processor and v is successor
c. both B and C are true
d. none is true
Q. If every node u in G is adjacent to every other node v in G, A graph is said to be
a. Isolated
b. Complete
c. Finite
d. Strongly connected
Q. A variable P is called pointer if
a. P points to the address of first element in DATA
b. P can store only memory addresses
c. P contain the DATA and the address of DATA
d. P contains the address of an element in DATA.
Q. The Worst case occur in linear search algo- rithm when
a. Item is not in the array at all
b. Item is the last element in the array
c. Item is the last element in the array or is not there at all
d. None of above
Q. The Average case occur in linear search al- gorithm
a. When Item is somewhere in the middle of the array
b. When Item is not in the array at all
c. When Item is the last element in the ar- ray
d. All the above
Q. The complexity of the average case of analgorithm is
a. Much more complicated to analyze than that of worst case
b. Much more simpler to analyze than that of worst case
c. Sometimes more complicated and some other times simpler than that of worst case
d. None of the above
Q. The following data structure allows deleting data elements from front and inserting at rear
a. Stacks
b. Queues
c. Deques
d. Binary search tree
Q. This data structure allows deletions at both ends of the list but insertion at only one end.
a. Input-restricted deque
b. Output-restricted deque
c. Priority queues
d. None of the above
Q. The following data structure is non-linear type
a. Strings
b. Lists
c. Stacks
d. None of the above
Q. To represent hierarchical relationship be- tween elements, the following data structure is not suitable
a. Deque
b. Priority
c. Tree
d. All of above