Miscellaneous On Data Structures - Study Mode

[#671] A biconnected graph contains how many cut vertices?
Correct Answer

(C) Zero

[#672] What happens when a free man approaches a married woman?
Correct Answer

(C) She goes through her preference list and accordingly, she replaces her current mate with him

[#673] What will be the chromatic number for an empty graph having n vertices?
Correct Answer

(B) 1

[#674] Heap's algorithm requires an auxiliary array to create permutations.
Correct Answer

(B) false

[#675] Which of the following algorithm can be used to solve the Hamiltonian path problem efficiently?
Correct Answer

(A) branch and bound