Match List I with List II

Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: B. A-II, B-III, C-IV, D-I
Explanation
Circular queues are used in round-robin CPU scheduling; priority queues in Dijkstra's algorithm; a deque checks palindromes from both ends; a simple FIFO queue handles print jobs.
More Data Structures and Algorithms questions
- Considering the binary tree shown (A has children B and C; C has children D and E; E has right child F; F has children G and H), what will…
- Match the LIST-I with LIST-II
- Which of the following algorithms are based on the Breadth First Search (BFS) ? A. Prim's algorithms B. Kruskal algorithms C. Dijkstra algo…
- Which of the following is the solution of the recurrence T(n) = T(2n/3) + 1?
- Match the LIST-I with LIST-II
- Arrange the following recurrence relations in increasing order of their time complexity: (A) T(n) = T(n/2) + 1 (B) T(n) = 2T(n/2) + n (C) T…