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 |
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
A circular queue is used in round-robin CPU scheduling (A-II). A priority queue is used in Dijkstra's algorithm (B-III). A double-ended queue can check palindromes by removing from both ends (C-IV). A simple FIFO queue is used for print jobs (D-I).More Data Structures and Algorithms questions
- The tight asymptotic bound for the recurrence T(n) = 2T(n/4) + √n is
- When developing a dynamic programming algorithm, the sequence of steps followed is: A. Construct an optimal solution from computed informat…
- The correct sequence of constructing a Huffman tree is A. Repeat until root formed B. Create leaf nodes C. Build priority queue D. Combine…
- Choose the correct statement(s) A. A problem which is NP-Complete will have the property that it can be solved in polynomial time iff all o…
- Consider the binary tree: A is the root with left child B and right child C; C has left child D and right child E; E has right child F; F h…
- Which of the following uses only increment operations for adding and removing elements at either end?