← Exit to Module 11: Collections Framework Deep Dive lessons
Module progress · 0%Lesson · 16 min
Module 11: Collections Framework Deep Dive
Lesson focusQueue & Deque Implementations
Use PriorityQueue, ArrayDeque, and BlockingQueue variants.
01 · 14 minCollections Hierarchy OverviewLocked02 · 18 minList Implementations: ArrayList, LinkedList, VectorLocked03 · 20 minSet Implementations: HashSet, TreeSet, LinkedHashSetLocked04 · 22 minMap Implementations: HashMap, TreeMap, LinkedHashMapLocked05 · 16 minQueue & Deque ImplementationsLocked06 · 12 minComparable vs ComparatorLocked07 · 12 minCollections Utility ClassLocked08 · 14 minIteration Techniques & Fail-Fast BehaviorLocked09 · 35 minMini-Project: Contact Management SystemLocked
ArrayDeque is a resizable array-based deque with O(1) push/pop at both ends.
PriorityQueue orders elements by priority; implement Comparable or supply Comparator.
Blocking queues (LinkedBlockingQueue, ArrayBlockingQueue) coordinate producer/consumer flows.