Miscellaneous on Data Structures MCQ question and answer with solution

A. T(n) = O(n)

B. T(n) = O(log n)

C. T(n) = O(n²log n)

D. T(n) = O(n²)

A. 0

B. 1

C. 2

D. n

A. Independent set

B. Dominant set

C. Vertex cover set

D. Edge cover set

A. they are replaced by the letter appearing immediately below them respectively

B. they are replaced by the letter appearing immediately right to them respectively

C. they are replaced by the letters at the corner of the row

D. that pair is neglected

A. True

B. False

A. {{2,1},{3,2},{3,1}}

B. {{1,2},{2,3},{1,3}}

C. {{1,2},{1,3},{2,3}}

D. {{2,1},{3,1},{3,2}}

A. To get maximum total value in the knapsack

B. To get minimum total value in the knapsack

C. To get maximum weight in the knapsack

D. To get minimum weight in the knapsack

A. Lester R. Ford and Delbert R. Fulkerson

B. T.E. Harris and F.S. Ross

C. Y.A. Dinitz

D. Kruskal

A. Even

B. Odd

C. Depends on graph

D. 1

A. 10

B. 9

C. 8

D. 7