Lesson 4.2: Queues

Video Lesson:

Slides	Annotated Slides	Video
4.2-queues.pdf Download 4.2-queues.pdf	4.2-queues-annotated.pdf Download 4.2-queues-annotated.pdf	Video Links to an external site. Access Passcode: 9Y!wH.c#

---

Readings:

• Carrano & Henry: Chapter 13.1 - 13.2 
• Carrano & Henry: Chapter 1.1-1.4

---

Summary:

We examine two fundamental approaches to implementing the queue abstract data type: singly linked lists, and arrays. For each, we make design choices that optimize performance.

---

Learning Outcomes:

• Identify appropriate entry and exit for linked list based implementation.
• Identify an efficient approach to implementing a queue with an array.