Top 350+ Solved Data Structures (DS) MCQ Questions Answer
Q. The pointer of the last node contains a special value called_____________.
a. null pointer.
b. index pointer.
c. pointer link.
d. address pointer.
Q. The OS of a computer may periodically collect all the deleted space onto the free storage list. Thistechnique is called______________.
a. buffering.
b. garbage collection.
c. deal location.
d. buffer collection.
Q. Important part of any compiler is the construction and maintenances of a dictionary, this types ofdictionary are called______________.
a. symbol table.
b. index table.
c. grammar table.
d. pointer table.
Q. The data structure required to check whether an expression contains balanced parenthesis is?
a. queue
b. stack
c. linked list
d. file
Q. What are the advantages of arrays?
a. Easier to store elements of same data type
b. Used to implement other data structures like stack and queue
c. Convenient way to represent matrices as a 2D array
d. All of the mentioned
Q. The earliest use of__________ sorting was in conjunction with network analysis.
a. topological.
b. bubble.
c. radix.
d. heap.
Q. _________is not the operation that can be performed on Queue.
a. Traversal.
b. Insertion.
c. Deletion.
d. Retrieval.
Q. The hashing file space is divided into_______________.
a. nodes and roots.
b. roots and slots.
c. buckets and slots.
d. slots and nodes.
Q. Matrices with a relatively high proportion of zero entries are called _______ matrices.
a. sparse.
b. Null.
c. Zero.
d. worse.
Q. The Postfix equivalent of the Prefix Notation * + ab - cd is
a. ab + cd - *
b. abcd +-*
c. ab+cd*-
d. ab+-cd*
Q. Data structure which is capable of expressing more complex relationship than that of physical adjacency iscalled______________.
a. linear data structure.
b. linked list.
c. non linear data Structure
d. data structure.
Q. A tree is a data structure which represents hierarchical relationship between individual _________.
a. data items.
b. fields.
c. nodes.
d. linked list.