C949 WGU Terminology
C949 WGU Terminology
Study online at https://quizlet.com/_5f8zpw
1. record data structure that stores subitems, with a name associated with each subitem
2. array a data structure that stores an ordered list of items, with each item is directly
accessible by a positional index
homogeneous data elements
3. linked list data structure that stores *ordered* list of items in nodes, where each node stores
data and has a pointer to the next node; can have multiple subitems
4. binary tree A data structure that consists of nodes, with one root node at the base of the tree,
and two nodes (left child and right child) extending from the root, and from each
child node
can have no children, single left or right, or both right and left
5. hash table data structure that stores *unordered* items by mapping (or hashing) each item
to a location in an array
6. max-heap a tree that maintains the simple property that a node's key is greater than or equal
to the node's childrens' keys
7. min-heap a tree that maintains the simple property that a node's key is less than or equal to
the node's childrens' keys
8. graph data structure for representing connections among items, and consists of vertices
connected by edges
9. vertice part of a graph the represents an item in a graph
10. edge part of a graph that represents a connection between to vertices in a graph
11. when inserting a new item at the beginning it causes no shift to the data
1/8
, C949 WGU Terminology
C949 WGU Terminology
Study online at https://quizlet.com/_5f8zpw
what is an advan-
tage of a linked
list over an array?
12. ADT (Abstract data type described by predefined user operations, such as "insert data at rear",
data Type) without indication how each operation is implemented
13. list ADT for holding ordered data
14. stack ADT which items are only inserted on or removed from the top of a stack
LIFO
15. Queue ADT in which items are inserted at the end of the queue and removed from the
front of the queue
FIFO
16. deque ("deck") ADT in which items can be removed at both the front and back
17. Bag ADT for stroing items in which the order does not matter and duplicate items are
allowed
18. Set ADT for collection of distinct items
common underlying DS: Binary search tree, hash table
19. Priority Queue a queue in which the highest-priority elements are removed first; within a priority
value, the earliest arrival is removed first.
common underlying DS: heap
20. Dictionary (map) ADT that associates (or maps) keys with values
common underlying DS: has table, binary search tree
2/8
C949 WGU Terminology
Study online at https://quizlet.com/_5f8zpw
1. record data structure that stores subitems, with a name associated with each subitem
2. array a data structure that stores an ordered list of items, with each item is directly
accessible by a positional index
homogeneous data elements
3. linked list data structure that stores *ordered* list of items in nodes, where each node stores
data and has a pointer to the next node; can have multiple subitems
4. binary tree A data structure that consists of nodes, with one root node at the base of the tree,
and two nodes (left child and right child) extending from the root, and from each
child node
can have no children, single left or right, or both right and left
5. hash table data structure that stores *unordered* items by mapping (or hashing) each item
to a location in an array
6. max-heap a tree that maintains the simple property that a node's key is greater than or equal
to the node's childrens' keys
7. min-heap a tree that maintains the simple property that a node's key is less than or equal to
the node's childrens' keys
8. graph data structure for representing connections among items, and consists of vertices
connected by edges
9. vertice part of a graph the represents an item in a graph
10. edge part of a graph that represents a connection between to vertices in a graph
11. when inserting a new item at the beginning it causes no shift to the data
1/8
, C949 WGU Terminology
C949 WGU Terminology
Study online at https://quizlet.com/_5f8zpw
what is an advan-
tage of a linked
list over an array?
12. ADT (Abstract data type described by predefined user operations, such as "insert data at rear",
data Type) without indication how each operation is implemented
13. list ADT for holding ordered data
14. stack ADT which items are only inserted on or removed from the top of a stack
LIFO
15. Queue ADT in which items are inserted at the end of the queue and removed from the
front of the queue
FIFO
16. deque ("deck") ADT in which items can be removed at both the front and back
17. Bag ADT for stroing items in which the order does not matter and duplicate items are
allowed
18. Set ADT for collection of distinct items
common underlying DS: Binary search tree, hash table
19. Priority Queue a queue in which the highest-priority elements are removed first; within a priority
value, the earliest arrival is removed first.
common underlying DS: heap
20. Dictionary (map) ADT that associates (or maps) keys with values
common underlying DS: has table, binary search tree
2/8
