r
/
notebook
1
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
notebook/notes/abstract-data-types/index.md

1.9 KiB
Raw Blame History

title TARGET DECK FILE TAGS tags
ADTs Obsidian::STEM adt
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%%

Bibliography