Question

Match LIST-I with LIST-II

\[\begin{array}{|c|c|}\hline \text{LIST-I} & \text{LIST-II} \\ \hline \text{A. The first index comes after the last index.} & \text{I. Head-tail Linked List} \\ \hline \text{B. More than one queue in the same array of sufficient size} & \text{IV. Multiple Queue} \\ \hline \text{C. Elements can be inserted or deleted at either end.} & \text{III. Circular Queue} \\ \hline \text{D. Each element is assigned a priority.} & \text{II. Priority Queue} \\ \hline \end{array}\] Choose the correct answer from the options given below:

• A. A - I, B - II, C - III, D - IV
• B. A - I, B - III, C - II, D - IV
• C. A - I, B - II, C - IV, D - III
• D. A - III, B - I, C - D, I - II

Hint:

When dealing with data structures, it is important to understand how the data is stored, accessed, and removed. This helps in correctly identifying each type of queue.

Answer 1

The Correct Option is A

Step 1: Evaluate each option. 
- **A. The first index comes after the last index.** This is describing a **Head-tail Linked List**, where the first index is at the end after the last element. This matches with **I. Head-tail Linked List**. 

- **B. More than one queue in the same array of sufficient size.** This describes a **Priority Queue**, where multiple queues can share the same memory space but have different priorities. This matches with **II. Priority Queue**. 

- **C. Elements can be inserted or deleted at either end.** This describes a **Circular Queue**, where elements can be added or removed from both ends. This matches with **III. Circular Queue**. 

- **D. Each element is assigned a priority.** This describes a **Multiple Queue**, where each element is assigned a specific priority. This matches with **IV. Multiple Queue**.

Step 2: Conclusion. 
Thus, the correct answer is (1) A - I, B - II, C - III, D - IV.