Skip to content
PlayOwl

Coding · Grade 11

Abstract Data Types and Invariants

Learners separate abstract data types from their implementations, specifying stacks and queues by their operations and rules, and apply them to bracket matching, browser history and print queues. They then study representation invariants through a circular-buffer queue with wrap-around indexes, and compare implementations of the same ADT to see why clients must depend only on the interface.

  • 4 lessons
  • About 100 minutes
  • Check what you learned: 8 questions
  • Ways to answer: choose an answer, put code in order, trace code, match pairs, type a number and sort into groups
Try it now (no account) One of the five free starter courses Open in PlayOwl

What learners will discover

  • Distinguish an abstract data type from its implementation and use ADT rules to predict stack and queue behaviour.
  • Apply stacks and queues to problems such as bracket matching, history and job scheduling.
  • State and maintain representation invariants, including wrap-around indexes in a circular buffer.
  • Compare implementations of the same ADT and explain why clients must use only the interface.

Lessons

  1. Abstract data types 5 steps2 practiceabout 20 min
  2. Stacks and queues at work 5 steps3 practiceabout 22 min
  3. Representation invariants 6 steps4 practiceabout 24 min
  4. Same ADT, different implementations 4 steps3 practiceabout 18 min
  5. Check what you learned 8 questions at the end

Keep exploring

More 11th grade coding

Guide for grown-ups