Sign inSign in
ConceptSystems & CS

Abstract data type

A high-level description of a data structure that defines its behavior and operations, independent of its implementation.
as Alan Kay defines itComputer History MuseumThe wording closest to all 5 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

4

Each in their own terms, from the easiest level.

  • Alan Kay

    Computer History Museum · Undergraduate

    • 55:14The Computer Revolution Hasn't Happened Yet (OOPSLA Keynote)
  • Erik Demaine

    MIT · Undergraduate

    An algorithmic specification of what a data structure is supposed to do, defining supported operations like insert and delete.
    • 50:00AVL Trees, Tree Rotations & Guaranteed O(log n) Height
  • David J. Malan

    Harvard University · Undergraduate

    A data structure that offers certain properties and characteristics, leaving the implementation details up to the programmer.
  • Josh Hug

    UC Berkeley · Undergraduate

    An abstract data type is defined entirely by its operations rather than its underlying implementation.
    • 44:54Interface and Implementation Inheritance

Lectures that assume it

7

Connections

21

The lectures that define it or assume it, and the concepts next to it.

4 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.