ConceptSystems & CS
Abstract data type
A high-level description of a data structure that defines its behavior and operations, independent of its implementation.
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
4Each in their own terms, from the easiest level.
Alan Kay
Erik Demaine
An algorithmic specification of what a data structure is supposed to do, defining supported operations like insert and delete.David J. Malan
A data structure that offers certain properties and characteristics, leaving the implementation details up to the programmer.Josh Hug
An abstract data type is defined entirely by its operations rather than its underlying implementation.
Lectures that assume it
7- Decision-Tree Ω(n log n) Lower Bound, Counting Sort & Radix Sort
- Hashing with Chaining, Simple Uniform Hashing & Universal Families
- The Power of Abstraction (ACM A.M. Turing Award Lecture)
- Table Doubling, Karp-Rabin
- Randomization: Universal & Perfect Hashing
- Dijkstra's Algorithm: Greedy Single-Source Shortest Paths
- Python
Connections
21The lectures that define it or assume it, and the concepts next to it.