Overview

While lists are a good general linear structure, you don’t always need all of the functionality and complexity of them. Today we are focused on a simpler data structure: the queue.

Basic Learning Objectives

Before class, you should be able to:

  • Explain what a queue is and how items are added and removed
  • Define FIFO

Advanced Learning Objectives

After class, you should be able to:

  • Implement your own version of a queue
  • Explain the algorithm for adding and removing items from a queue

Readings

You should read the reading assignment through Moodle:

Checks

No additional checks.