Match List I with List II List I List II A. Circular Queue I. Print Queue B.…
2025
Match List I with List II
List I | List II |
A. Circular Queue | I. Print Queue |
B. Priority Queue | II. CPU Scheduling |
C. Double Ended Queue | III. Dijkstra Algorithm |
D. Simple Queue | IV. Palindrome Checking |
Choose the correct answer from the options given below:
- A.
A-II, B-III, C-I, D-IV
- B.
A-II, B-III, C-IV, D-I
- C.
A-III, B-II, C-I, D-IV
- D.
A-IV, B-II, C-I, D-III
Attempted by 324 students.
Show answer & explanation
Correct answer: B
Correct matching: Circular Queue → CPU Scheduling; Priority Queue → Dijkstra Algorithm; Double Ended Queue → Palindrome Checking; Simple Queue → Print Queue.
Circular Queue → CPU Scheduling. Round-robin CPU scheduling uses a circular buffer to cycle through processes in FIFO order without shifting elements.
Priority Queue → Dijkstra Algorithm. Dijkstra's algorithm repeatedly extracts the node with the smallest tentative distance, which is efficiently supported by a priority queue.
Double Ended Queue → Palindrome Checking. A deque allows removal from both ends so you can compare front and rear characters to test for palindromes.
Simple Queue → Print Queue. Print jobs are processed in first-in, first-out order, which is the behavior of a simple queue.
A video solution is available for this question — log in and enroll to watch it.