Top MCQs on Data Structures in DSA with Answers

Question 31

Match the following:

• (1)

• (2)

• (3)

• (4)

Question 32

A symbol table of length 152 is processing 25 entries at any instant. What is occupation density?

• 0.164
• 127
• 8.06
• 6.08

Question 33

Given the symbols A, B, C, D, E, F, G and H with the probabilities 1 / 30, 1 / 30, 1 / 30, 2 / 30, 3 / 30, 5 / 30, 5 / 30, and 12 / 30 respectively. The average Huffman code size in bits per symbol is:

• 67 / 30

• 70 / 30

• 76 / 30

• 78/ 30

Question 34

A 5-ary tree is tree in which every internal node has exactly 5 children. The number of left nodes in such a tree with 8 internal nodes will be:

• 30
• 33
• 45
• 130

Question 35

Consider the following two sentences : (a) The planning graph data structure can be used to give a better heuristic for a planning problem. (b) Dropping negative effects from every action schema in a planning problem results in a relaxed problem. Which of the following is correct with respect to the above sentences ?

• Both sentence (a) and sentence (b) are false.
• Both sentence (a) and sentence (b) are true.
• Sentence (a) is true but sentence (b) is false.
• Sentence (a) is false but sentence (b) is true.

Question 36

Question

• 1
• 2
• 3
• 4

Question 37

Consider double hashing of the form h(k,i)=(h​ 1​ (k)+ih​ 2​ (k)) mod m Where h​ 1​ (k)=k mod m h​ 2​ (k)=1+(k mod n) Where n=m-1and m=701 for k=123456, what is the difference between first and second probes in terms of slots?

• 255
• 256
• 257
• 258

Question 38

The number of possible min-heaps containing each value from {1, 2, 3, 4, 5, 6, 7} exactly once is _______. Note -This was Numerical Type question.

• 80

• 8

• 20

• 210

Question 39

Let G be a simple undirected graph. Let T_D be a depth first search tree of G. Let T_B be a breadth first search tree of G. Consider the following statements. (I) No edge of G is a cross edge with respect to T_D. (A cross edge in G is between two nodes neither of which is an ancestor of the other in T_D). (II) For every edge (u, v) of G, if u is at depth i and v is at depth j in T_B, then ∣i − j∣ = 1. Which of the statements above must necessarily be true?

• I only

• II only

• Both I and II

• Neither I nor II