C949 WGU TERMINOLOGY EXAMS
QUESTIONS WITH CORRECT
ANSWERS
1. record - ANSWER-data structure that stores subitems, with a
name associated with each subitem
2. array - ANSWER-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 - ANSWER-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 - ANSWER-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 - ANSWER-data structure that stores *unordered*
items by mapping (or hashing) each item to a location in an
array
6. max-heap - ANSWER-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 - ANSWER-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 - ANSWER-data structure for representing connections
among items, and consists of vertices connected by edges
9. vertice - ANSWER-part of a graph the represents an item in a
graph
10. edge - ANSWER-part of a graph that represents a
connection between to vertices in a graph
11. what is an advantage of a linked list over an array? -
ANSWER-when inserting a new item at the beginning it causes
no shift to the data
12. ADT (Abstract data Type) - ANSWER-data type described
by predefined user operations, such as "insert data at rear",
without indication how each operation is implemented
13. list - ANSWER-ADT for holding ordered data
14. stack - ANSWER-ADT which items are only inserted on or
removed from the top of a stack
15. LIFO
16. Queue - ANSWER-ADT in which items are inserted at the
end of the queue and removed from the front of the queue
QUESTIONS WITH CORRECT
ANSWERS
1. record - ANSWER-data structure that stores subitems, with a
name associated with each subitem
2. array - ANSWER-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 - ANSWER-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 - ANSWER-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 - ANSWER-data structure that stores *unordered*
items by mapping (or hashing) each item to a location in an
array
6. max-heap - ANSWER-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 - ANSWER-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 - ANSWER-data structure for representing connections
among items, and consists of vertices connected by edges
9. vertice - ANSWER-part of a graph the represents an item in a
graph
10. edge - ANSWER-part of a graph that represents a
connection between to vertices in a graph
11. what is an advantage of a linked list over an array? -
ANSWER-when inserting a new item at the beginning it causes
no shift to the data
12. ADT (Abstract data Type) - ANSWER-data type described
by predefined user operations, such as "insert data at rear",
without indication how each operation is implemented
13. list - ANSWER-ADT for holding ordered data
14. stack - ANSWER-ADT which items are only inserted on or
removed from the top of a stack
15. LIFO
16. Queue - ANSWER-ADT in which items are inserted at the
end of the queue and removed from the front of the queue
