Miscellaneous on Data Structures MCQ question and answer with solution

A. ({1,3},{4,3},{4,5})

B. ({1,2},{2,3},{4,5})

C. ({1,0},{4,3},{4,2})

D. ({1,2},{3,2},{4,5})

A. FACTSFUN

B. FACTFUNS

C. FUNSFACT

D. FUNFACTS

A. Linux

B. Mac

C. Windows

D. VAX/VMS

A. Recursion is always better than iteration

B. Recursion uses more memory compared to iteration

C. Recursion uses less memory compared to iteration

D. Iteration is always better and simpler than recursion

A. O(n*r)

B. O(n/r)

C. O(n)

D. O(r)

A. 0

B. 1

C. 2

D. 3

A. Recursion

B. Iteration

C. Greedy algorithm

D. Both recursion and iteration

A. True

B. False

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

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

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

D. cannot be solved using master's theorem

A. FIFO

B. Optimal page replacement

C. LRU replacement

D. Counting based replacement