Overview

Deque (usually pronounced like “deck”) is an irregular acronym of double-ended queue. Double-ended queues are sequence containers with dynamic sizes that can be expanded or contracted on both ends (either its front or its back).1

In this project, we will compare 3 implementations of a deque. By the end, students will be able to:

  • Understand the difference between an ADT and a data structure.
  • Understand data structure invariants and their value in testing programs.
  • Practice debugging code using tests.

To complete the project, address all deliverables labeled Task.

  1. cplusplus.com. deque - C++ Reference. http://www.cplusplus.com/reference/deque/deque/ ↩

Subpages

  1. Getting Started - Acquire the assignment and set up for working with partners.
  2. Programming - Complete the programming portion of the assignment.
  3. Tests - Test your code locally and on Gradescope.