Dynamic Programming In Data Structures - Study Mode

Show All Answers

[#116] In the brute force implementation to find the longest increasing subsequence, all the subsequences of a given sequence are found. All the increasing subsequences are then selected and the length of the longest subsequence is found. What is the time complexity of this brute force implementation?

(A) O(n)

(B) O(n 2 )

(C) O(n!)

(D) O(2 n )

Correct Answer

(D) O(2 n )

[#117] Consider the expression T & F ∧ T. What is the number of ways in which the expression can be parenthesized so that the output is T (true)?

(A) 0

(B) 1

(C) 2

(D) 3

Correct Answer

(C) 2

[#118] What is the sum of each of the balanced partitions for the array {5, 6, 7, 10, 3, 1}?

(A) 16

(B) 32

(C) 0

(D) 64

Correct Answer

(A) 16

[#119] If an optimal solution can be created for a problem by constructing optimal solutions for its subproblems, the problem possesses . . . . . . . . property.

(A) Overlapping subproblems

(B) Optimal substructure

(C) Memoization

(D) Greedy

Correct Answer

(B) Optimal substructure

[#120] Consider the following array: {1, 3, 5, 8, 9, 2, 6, 7, 6} What is the minimum number of jumps required to reach the end of the array?

(A) 1

(B) 2

(C) 3

(D) 4

Correct Answer

(C) 3