2.6 KiB
| title | TARGET DECK | FILE TAGS | tags | |
|---|---|---|---|---|
| ADTs | Obsidian::STEM | 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.
%%ANKI Basic What is an ADT an acronym for? Back: Abstract Data Ttype. Reference: “Abstract Data Type.” In Wikipedia, March 18, 2024. https://en.wikipedia.org/w/index.php?title=Abstract_data_type&oldid=1214359576.
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.
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.
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.
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).
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).
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).
END%%
Bibliography
- “Abstract Data Type.” In Wikipedia, March 18, 2024. https://en.wikipedia.org/w/index.php?title=Abstract_data_type&oldid=1214359576.