Miscellaneous On Data Structures - Practice Test

[#221] What will be the chromatic index of the following graph?

(A) 2

(B) 3

(C) 4

(D) 5

(E) 1

(F) 2

(G) 3

(H) 4

Correct Answer

(B) 3
(F) 2

[#222] What is the auxiliary space requirement of the quickselect algorithm?

(A) O(n 2 )

(B) O(n)

(C) O(n log n)

(D) O(1)

Correct Answer

(D) O(1)

[#223] Are trees bipartite?

(A) Yes

(B) No

(C) Yes if it has even number of vertices

(D) No if it has odd number of vertices

Correct Answer

(A) Yes

[#224] Bellmann Ford Algorithm is an example for . . . . . . . .

(A) Linear Programming

(B) Greedy Algorithms

(C) Dynamic Programming

(D) Branch and Bound

Correct Answer

(C) Dynamic Programming

[#225] By using which of the following data structure, the hash sequence is implemented within the hash table in coalesced hashing?

(A) Linked list

(B) Stack

(C) Tree

(D) Queue

Correct Answer

(A) Linked list

Miscellaneous On Data Structures - Study Mode

[#221] What will be the chromatic index of the following graph?

Correct Answer

[#222] What is the auxiliary space requirement of the quickselect algorithm?

Correct Answer

[#223] Are trees bipartite?

Correct Answer

[#224] Bellmann Ford Algorithm is an example for . . . . . . . .

Correct Answer

[#225] By using which of the following data structure, the hash sequence is implemented within the hash table in coalesced hashing?

Correct Answer