---
title: ADTs
TARGET DECK: Obsidian::STEM
FILE TAGS: adt
tags:
  - adt
---

## Overview

An **abstract data type** (ADT) is a mathematical model for data types, defined in terms of its behavior (semantics). An ADT's implementation often takes the form of a [[data-structures/index|data structure]].

%%ANKI
Basic
What is an ADT an acronym for?
Back: **A**bstract **D**ata **T**ype.
Reference: “Abstract Data Type.” In _Wikipedia_, March 18, 2024. [https://en.wikipedia.org/w/index.php?title=Abstract_data_type&oldid=1214359576](https://en.wikipedia.org/w/index.php?title=Abstract_data_type&oldid=1214359576).
<!--ID: 1714669011569-->
END%%

%%ANKI
Basic
What is an ADT (abstract data type)?
Back: A mathematical model for data types, defined in terms of its behavior.
Reference: “Abstract Data Type.” In _Wikipedia_, March 18, 2024. [https://en.wikipedia.org/w/index.php?title=Abstract_data_type&oldid=1214359576](https://en.wikipedia.org/w/index.php?title=Abstract_data_type&oldid=1214359576).
<!--ID: 1714669011571-->
END%%

%%ANKI
Cloze
An {1:ADT} is to a {2:data structure} as an {2:ISA} is to a {1:uarch}.
Reference: “Abstract Data Type.” In _Wikipedia_, March 18, 2024. [https://en.wikipedia.org/w/index.php?title=Abstract_data_type&oldid=1214359576](https://en.wikipedia.org/w/index.php?title=Abstract_data_type&oldid=1214359576).
<!--ID: 1714669011572-->
END%%

%%ANKI
Basic
What term describes the concrete implementation of an ADT?
Back: A data structure.
Reference: “Abstract Data Type.” In _Wikipedia_, March 18, 2024. [https://en.wikipedia.org/w/index.php?title=Abstract_data_type&oldid=1214359576](https://en.wikipedia.org/w/index.php?title=Abstract_data_type&oldid=1214359576).
<!--ID: 1714677608770-->
END%%

%%ANKI
Cloze
{1:FIFO} is to {2:queues} as {2:LIFO} is to {1:stacks}.
Reference: Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (Cambridge, Massachusett: The MIT Press, 2022).
<!--ID: 1715461853935-->
END%%

%%ANKI
Cloze
{`PUSH`} is to stacks as {`ENQUEUE`} is to queues.
Reference: Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (Cambridge, Massachusett: The MIT Press, 2022).
<!--ID: 1715461853939-->
END%%

%%ANKI
Cloze
{`POP`} is to stacks as {`DEQUEUE`} is to queues.
Reference: Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (Cambridge, Massachusett: The MIT Press, 2022).
<!--ID: 1715461853943-->
END%%

## Bibliography

* “Abstract Data Type.” In _Wikipedia_, March 18, 2024. [https://en.wikipedia.org/w/index.php?title=Abstract_data_type&oldid=1214359576](https://en.wikipedia.org/w/index.php?title=Abstract_data_type&oldid=1214359576).