C949 Data Structures and Algorithms
C949 Data Structures and Algorithms
Study Guide Exam Questions Review (56
terms) with Certified Solutions 2024.
Record - Answer: Data structure that stores subitems, w/ names associated w/
each subitem
Array - Answer: Data structure that stores an ordered list of items, w/ each item
directly accessible by a positional index.
Linked List - Answer: Data structure that stores an ordered list as nodes, each
node stores data and has a pointer to the next node.
, C949 Data Structures and Algorithms
Binary Tree - Answer: Data structure where each node stores data and has up to
two children, left child and right child.
Hash Table - Answer: Data structure that stores unordered items by mapping each
item to a location in an array.
Max Heap - Answer: Tree that maintains the simple property that a node's key is
greater than or equal to a node's children key.
Min Heap - Answer: A tree that maintains simple property that node's key is less
than or equal to the node's children key.
Graph - Answer: Represents connections among items. Consists of vertices and
edges. Vertex represents an item on a graph. Edges represent a connection
between two vertices.
ADT (Abstract Data Type) - Answer: Data type described by predefined user
operations. Does not say anything about the implementation.
C949 Data Structures and Algorithms
Study Guide Exam Questions Review (56
terms) with Certified Solutions 2024.
Record - Answer: Data structure that stores subitems, w/ names associated w/
each subitem
Array - Answer: Data structure that stores an ordered list of items, w/ each item
directly accessible by a positional index.
Linked List - Answer: Data structure that stores an ordered list as nodes, each
node stores data and has a pointer to the next node.
, C949 Data Structures and Algorithms
Binary Tree - Answer: Data structure where each node stores data and has up to
two children, left child and right child.
Hash Table - Answer: Data structure that stores unordered items by mapping each
item to a location in an array.
Max Heap - Answer: Tree that maintains the simple property that a node's key is
greater than or equal to a node's children key.
Min Heap - Answer: A tree that maintains simple property that node's key is less
than or equal to the node's children key.
Graph - Answer: Represents connections among items. Consists of vertices and
edges. Vertex represents an item on a graph. Edges represent a connection
between two vertices.
ADT (Abstract Data Type) - Answer: Data type described by predefined user
operations. Does not say anything about the implementation.
