Dynamic Programming In Data Structures - Study Mode

Show All Answers

[#181] In the worst case, the minimum number of insertions to be made to convert the string into a palindrome is equal to the length of the string.

(A) True

(B) False

Correct Answer

(B) False

[#182] What is the time complexity of Kadane's algorithm?

(A) O(1)

(B) O(n)

(C) O(n 2 )

(D) O(5)

Correct Answer

(B) O(n)

[#183] You are given infinite coins of denominations 1, 3, 4. What is the total number of ways in which a sum of 7 can be achieved using these coins if the order of the coins is not important?

(A) 4

(B) 3

(C) 5

(D) 6

Correct Answer

(C) 5

[#184] Longest common subsequence is an example of . . . . . . . .

(A) Greedy algorithm

(B) 2D dynamic programming

(C) 1D dynamic programming

(D) Divide and conquer

Correct Answer

(B) 2D dynamic programming

[#185] What is the time complexity of the brute force implementation of the maximum sum rectangle problem?

(A) O(n)

(B) O(n 2 )

(C) O(n 3 )

(D) O(n 4 )

Correct Answer

(D) O(n 4 )