Queue Quiz: Test Your Knowledge of FIFO Data Structures in Java

📚 Quick Study Guide

• ⏱️ FIFO (First-In, First-Out): Elements are processed in the order they arrive.
• ➡️ Enqueue: Adding an element to the rear of the queue.
• ⬅️ Dequeue: Removing an element from the front of the queue.
• peek(): Examines the element at the front of the queue without removing it.
• isEmpty(): Checks if the queue is empty.
• size(): Returns the number of elements in the queue.
• ⚙️ Common Implementations: Queues can be implemented using arrays or linked lists.

🧪 Practice Quiz

1. Question 1: Which of the following statements best describes the FIFO principle in a queue?
1. A. Last element in, first element out.
2. B. First element in, first element out.
3. C. Elements are processed randomly.
4. D. Elements are processed based on priority.
2. Question 2: What operation adds an element to the rear of a queue?
1. A. Dequeue
2. B. Enqueue
3. C. Peek
4. D. Pop
3. Question 3: What operation removes an element from the front of a queue?
1. A. Enqueue
2. B. Peek
3. C. Dequeue
4. D. Add
4. Question 4: Which method allows you to view the element at the front of the queue without removing it?
1. A. remove()
2. B. peek()
3. C. poll()
4. D. get()
5. Question 5: What is the primary use of a queue?
1. A. Storing elements in sorted order.
2. B. Managing elements based on priority.
3. C. Processing elements in the order they arrive.
4. D. Random access of elements.
6. Question 6: Which data structure can be used to implement a queue?
1. A. Tree
2. B. Graph
3. C. Linked List
4. D. Set
7. Question 7: What happens when you try to dequeue from an empty queue?
1. A. Returns null.
2. B. Throws an exception.
3. C. Returns the last element added.
4. D. The program crashes.