Fundamentals of data structures Flashcards
What is a one-dimensional array?
An indexed set of related elements all of the same data type.
What is a two-dimensional array?
An array that has rows as well as columns of elements
What is a dynamic data structure?
A data structure that changes size according to how much data is in it
What is a static data structure?
A data structure that has a fixed size
What is a stack?
A data structure that follows the LIFO system
What is a queue?
A data structure that follows a FIFO system
What is a circular queue?
A queue that the front and rear pointers can move over the two ends of the queue.
What is a priority queue?
A queue in which items are assigned a priority.
What is a graph?
An abstract data structure used to represent complex relationships between items in datasets
What are nodes on a graph?
A node contains the actual data being stored
What are vertices on a graph?
A vertice connects nodes on a graph
What is the difference between an adjacency list and an adjacency matrix?
An adjacency matrix details each and every single connection on a graph (including unconnected ones) whereas an adjacency list only records existing connections.
What is a tree?
A tree is a connected, undirected graph with no cycles
What is a binary tree?
A binary tree is a tree that only has 2 children per node.
What is a hashing algorithm?
An algorithm that takes an input and returns a hash. The hash is unique and cannot be reversed.
