Dynamic Programming In Data Structures - Study Mode

Show All Answers

[#141] Which of the following is NOT a Catalan number?

(A) 1

(B) 5

(C) 14

(D) 43

Correct Answer

(D) 43

[#142] Find the maximum sub-array sum for the given elements. {2, -1, 3, -4, 1, -2, -1, 5, -4}

(A) 3

(B) 5

(C) 8

(D) 6

Correct Answer

(B) 5

[#143] The dynamic programming implementation of the maximum sum rectangle problem uses which of the following algorithm?

(A) Hirschberg's algorithm

(B) Needleman-Wunsch algorithm

(C) Kadane's algorithm

(D) Wagner Fischer algorithm

Correct Answer

(C) Kadane's algorithm

[#144] There are n dice with f faces. The faces are numbered from 1 to f. What is the minimum possible sum that can be obtained when the n dice are rolled together?

(A) 1

(B) f

(C) n

(D) n*f

Correct Answer

(C) n

[#145] 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