Q34.Marks: +2.0UGC NET Paper 2: Computer Science and Application 26th June 2025 Shift 1
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:
1.A-II, B-III, C-I, D-IV
2.A-II, B-III, C-IV, D-I✓ Correct
3.A-III, B-II, C-I, D-IV
4.A-IV, B-II, C-I, D-III
Solution
The Correct Answer is Option 2
Key Points
A. Circular Queue - II (CPU Scheduling):
A circular queue is a linear data structure that follows the FIFO principle but the last node is connected back to the first node, forming a circle.
It is often used in CPU scheduling algorithms where processes are placed in a circular queue to ensure equal time allocation to each process in a round-robin manner.
Thus, Circular Queue is most commonly associated with CPU Scheduling.
B. Priority Queue - III (Dijkstra Algorithm):
A priority queue is a type of data structure where each element is associated with a priority and is served according to its priority level.
It is used in Dijkstra's algorithm to find the shortest path in a weighted graph by prioritizing vertices with the smallest tentative distance.
Hence, Priority Queue is used in Dijkstra Algorithm.
C. Double Ended Queue - IV (Palindrome Checking):
A double-ended queue (Deque) allows insertion and deletion at both ends of the queue.
It is useful in palindrome checking as characters can be removed from both ends to verify symmetry.
Thus, Double Ended Queue is associated with Palindrome Checking.
D. Simple Queue - I (Print Queue):
A simple queue is a linear data structure that follows the FIFO principle, where elements are added at the rear and removed from the front.
It is ideal for managing print queues where print jobs are processed in the order they were added.
