Question

Match List I with List II

LIST I	LIST II
(A) Circular Linked List	(I) Recursive Function Calls
(B) Doubly Linked List	(II) Round Robin Queue in CPU
(C) Stack	(III) Hash Tables
(D) Singly Linked List	(IV) Undo and Redo Functionality

Choose the correct answer from the options given below:

• (A) - (I), (B) - (II), (C) - (III), (D) - (IV)
• (A) - (II), (B) - (III), (C) - (IV), (D) - (I)
• (A) - (II), (B) - (IV), (C) - (I), (D) - (III)
• (A) - (III), (B) - (II), (C) - (I), (D) - (IV)

Hint:

Match data structures with their practical usage scenarios to answer such questions effectively.

Answer 1

The Correct Option is B

- Round Robin Queues utilize Circular Linked Lists. - Undo and Redo operations employ Doubly Linked Lists. - Stacks manage Recursive Function Calls. - Hash Tables frequently incorporate Singly Linked Lists.