Miscellaneous On Data Structures - Study Mode
[#841] In how many ways can a Gomory-Hu tree be implemented?
Correct Answer
(B) 2
[#842] Which of the following is true about the time complexity of the recursive solution of the subset sum problem?
Correct Answer
(A) It has an exponential time complexity
[#843] Gronsfeld cipher is harder to crack than caesar cipher.
Correct Answer
(A) True
[#844] In what time can the Hamiltonian path problem can be solved using dynamic programming?
Correct Answer
(D) O(N 2 2 N )
[#845] In a optimal page replacement algorithm, when a page is to be replaced, which of the following pages is chosen?
Correct Answer
(D) Not frequently occurred page in the future