Miscellaneous On Data Structures - Study Mode
[#556] Poly alphabetic cipher harder to decipher than mono alphabetic cipher.
Correct Answer
(A) true
[#557] Solve the following recurrence using Master's theorem. T(n) = 0.7 T (n/2) + 1/n
Correct Answer
(D) cannot be solved using master's theorem
[#558] A two-out-of-five code consists of . . . . . . . .
Correct Answer
(B) Three 0s and two 1s
[#559] Recursive solution of Set partition problem is faster than dynamic problem solution in terms of time complexity.
Correct Answer
(B) false
[#560] What is the basic operation of closest pair algorithm using brute force technique?
Correct Answer
(A) Euclidean distance