Queues in Java Collections Framework
This directory covers Queue and Deque implementations in Java, designed for holding elements prior to processing in sequential or prioritized order.
Lessons Map
1. Queue Interface (FIFO Buffering)
- Queue Interface Guide: FIFO, hierarchy, and basic offer/poll methods.
- Queue Internal Workings: LinkedList nodes vs ArrayDeque arrays.
- Queue Interview Questions: Standard tech Q&As.
2. PriorityQueue (Heap Sorting)
- PriorityQueue Guide: Natural sorting, custom comparators, and priority tasks.
- PriorityQueue Internal Workings: Binary min-heaps, parent/child index math, and sift-up/down operations.
- PriorityQueue Interview Questions: Q&As on heap resizing and iteration limits.
3. ArrayDeque (Double-Ended Circular Buffer)
- ArrayDeque Guide: Double-ended queue methods, stack implementations, and efficiency.
- ArrayDeque Internal Workings: Circular pointer math (
(head - 1) & mask) and table resizing. - ArrayDeque Interview Questions: Stack alternatives and speed details.
4. Queue Mini Projects
- 01_Ticket_Booking_System: FIFO customer booking.
- 02_Printer_Queue_System: Document printing delay simulation.
- 03_Hospital_Patient_Queue: ER patient priority triage.
Back to Collection Framework Home: JCF Index