Data Structures Flashcards
Contiguous Memory Locations
memory locations for consecutive blocks of memory for a file/process
Data Cube
another word for tuple, a three-dimensional array
Dot Syntax
involves adding a dot after the structure name, which makes the IDE display all available options
Dynamic Data Structure
involves adding a dot after the structure name, which makes the IDE display all available options
FIFO
First In First Out
items are always removed from the front and added at the back
Hash Table
a data structure that stores data in an associative manner, where each item maps to another
Immutable
where data values are fixed and cannot be changed over time
List
a data structure separated by commas
Linear List
a one-dimensional list with separate entries
Linked List
dynamic data structure where data is not necessarily stored in order or in contiguous memory locations, a multi-dimensional list where each entry has a link to the next
Tree
a hierarchical data structure used to represent and organised data in a way that is easy to navigate and search
Binary Tree
a tree where each node can only have two children, referred to as left child and right child
Booking Tree
a tree use specifically for searching
Hierarchical Tree
often more interlinked than other forms of tree
Queue
a FIFO data structure with pointers indicating the front and back, though the rear pointer may indicate the next free space instead of the last item in the queue
Circular Queue
a type of queue that is extended so that the first element is connected to the second element; unless full, a circular queue loops back to the beginning when the end of the queue is recorded