Miscellaneous on Data Structures MCQ question and answer with solution

A. vigenere cipher

B. autokey cipher

C. running key cipher

D. trithemius cipher

A. O(n)

B. O(n²)

C. O(1)

D. O(log n)

A. Prim's algorithm

B. Kruskal's algorithm

C. Dijkstra's algorithm

D. Ford-Fulkerson algorithm

A. 3 Dots, 3Dashes, and 3 Dots

B. 3 Dots, 3 Dashes, and 2 Dots

C. 3 Dots, 2 Dashes, and 3 Dots

D. 2 Dots, 3 Dashes, and 3 Dots

A. T(n) = O(n)

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

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

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

A. Konig's Theorem

B. Kirchhoff's Theorem

C. Kuratowski's Theorem

D. Kelmans Theorem

A. 12

B. 15

C. 16

D. 20

A. additive cipher

B. multiplicative cipher

C. afffine cipher

D. hill cipher

A. O(n+m)

B. O(n(n+m)

C. O(√n(n+m))

D. O(n+2)

A. True

B. False