Category: Data Structures & Algorithm Mcqs

A. O(1)

B. O(n)

C. O(n2)

D. O(n3)

A. 13

B. 16

C. 14

D. 19

A. Greedy algorithm

B. 2D dynamic programming

C. 1D dynamic programming

D. Divide and conquer

A. O(n)

B. O(m)

C. O(m + n)

D. O(mn)

A. O(1)

B. O(n)

C. O(n2)

D. None of the mentioned

A. 4

B. 3

C. 5

D. 6

View Full

A. 0

B. 4

C. None of the mentioned

D. Cannot be determined

A. 0

B. 2

C. 4

D. 8

View Full

a) Mergesort
b) Binary search
c) Longest common subsequence
d) Quicksort

a) 0/1 knapsack problem
b) Matrix chain multiplication problem
c) Edit distance problem
d) Fractional knapsack problem