Miscellaneous On Data Structures - Study Mode
[#691] Recursive solution of tower of hanoi problem is an example of which of the following algorithm?
Correct Answer
(D) Divide and conquer
[#692] A matching M is maximal if and only if there exists no augmenting path with respect to M.
Correct Answer
(A) True
[#693] Consider the following algorithm of Karger's algorithm given below. Which of the following best suits the blank? Let G=(V, E)
while (V > 2)
pick any edge e from E randomly
__________________________
remove self-loops
return the cut left with last 2 vertices
Correct Answer
(A) merge or contract both vertices in a single vertex
[#694] What is the result of the recurrences which fall under the extended second case of Master's theorem (let the recurrence be given by T(n)=aT(n/b)+f(n) and f(n)=n c (log n)k?
Correct Answer
(C) T(n)= O(n c (log n) k+1
[#695] What will be the encrypted text corresponding to plain text "HELLO" using standard polybius square cipher?
Correct Answer
(A) 2315313134