Top 350+ Solved Data Structures (DS) MCQ Questions Answer
Q. The sequence (1,1) (2,1) (3,1) (1,2) (2,2) (3,2) . . . .represents _________.
a. row major order.
b. column major order.
c. random order.
d. successive order.
Q. Selection sort and quick sort both fall into the same category of sorting algorithms._________ is thatcategory.
a. O(n log n) sorts.
b. Divide-and-conquer sorts.
c. Interchange sorts.
d. Average time is quadratic.
Q. The possibility of two different keys k1 & k2 yielding the same hash address is called__________.
a. merge.
b. obstacle.
c. overlapping.
d. collision.
Q. Uniform distribution of the hash address throughout the given set L is __________.
a. reduce the number of collision.
b. increase the number of collision.
c. totally avoid collision.
d. manage address.
Q. An edge E is called _________ if it has identical endpoints.
a. multiple edges.
b. loops.
c. finite.
d. digraph.
Q. __________involves maintaining two tables in memory.
a. Arranging.
b. Bonding.
c. Combing.
d. Chaining.
Q. An _________ is a well defined list of steps for solving a problem.
a. Algorithm.
b. Program.
c. Procedure.
d. Process.
Q. The data items in a record form a ________ structure which can be described by means of level numbers.
a. hierarchical.
b. procedural.
c. indexed.
d. levele
Q. A path P of length n from a node u to a node v is defined as a sequence of _________ nodes.
a. n.
b. n+1.
c. n+2.
d. n-1.
Q. A vertex of degree one is called __________.
a. padent
b. isolated vertex
c. null vertex
d. colored vertex
Q. A connected graph T without any cycles is called _____________.
a. a tree graph.
b. free tree.
c. a tree.
d. all of the above.
Q. If every node u in G is adjacent to every other node v in G, A graph is said to be _______.
a. isolate.
b. complete.
c. finite.
d. Strongly connecte
Q. In a graph G if e=(u,v), then u and v are called ___________.
a. endpoints.
b. adjacent nodes.
c. neighbours.
d. all of the above.
Q. Which of the following is true while inserting a new node in the list?
a. Check there is node in the list.
b. Check in the free node in the pool.
c. There is no node.
d. Underflow.