Dynamic Programming In Data Structures - Study Mode
[#86] In the context of Dynamic Programming, what is the typical use of "backtracking"?
Correct Answer
(C) To reconstruct the solution from the computed results.
[#87] Consider the two strings ""(empty string) and "abcd". What is the edit distance between the two strings?
Correct Answer
(B) 4
[#88] For which of the following pairs of strings is the edit distance maximum?
Correct Answer
(D) wednesday & thursday
[#89] Consider the recursive implementation to find the nth fibonacci number: Which line would make the implementation complete? int fibo(int n)
if n <= 1
return n
return __________
Correct Answer
(D) fibo(n - 1) + fibo(n - 2)
[#90] What is the time complexity of the brute force algorithm used to solve the balanced partition problem?
Correct Answer
(D) O(2 n )