C949 WGU TERMINOLOGY QUESTIONS
AND ANSWERS COMPLETE STUDY GUIDE
EXAM PREP PRACTICE TEST
| GRADED A+ | GUARANTEED SUCCESS
UPDATED QUESTIONS AND ANSWERS
100% VERIFIED EXAM PREP
[EXAM• STUDY GUIDE • SUMMARY • ASSIGNMENT]
A clean, organized resource designed for easy revision and reference.
QUICK • CLEAR • PROFESSIONAL
, hash table data structure that stores unordered items by mapping (or hashing) each item to a
location in an array
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
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
graph data structure for representing connections among items, and consists of vertices
connected by edges
vertice part of a graph the represents an item in a graph
edge part of a graph that represents a connection between to vertices in a graph
what is an advantage of a linked list over an array? when inserting a new item at the beginning it causes no shift to the data
ADT (Abstract data Type) data type described by predefined user operations, such as "insert data at rear", without
indication how each operation is implemented
list ADT for holding ordered data
stack ADT which items are only inserted on or removed from the top of a stack
LIFO
Queue ADT in which items are inserted at the end of the queue and removed from the front of
the queue
FIFO
deque ("deck") ADT in which items can be removed at both the front and back
Bag ADT for stroing items in which the order does not matter and duplicate items are allowed
AND ANSWERS COMPLETE STUDY GUIDE
EXAM PREP PRACTICE TEST
| GRADED A+ | GUARANTEED SUCCESS
UPDATED QUESTIONS AND ANSWERS
100% VERIFIED EXAM PREP
[EXAM• STUDY GUIDE • SUMMARY • ASSIGNMENT]
A clean, organized resource designed for easy revision and reference.
QUICK • CLEAR • PROFESSIONAL
, hash table data structure that stores unordered items by mapping (or hashing) each item to a
location in an array
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
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
graph data structure for representing connections among items, and consists of vertices
connected by edges
vertice part of a graph the represents an item in a graph
edge part of a graph that represents a connection between to vertices in a graph
what is an advantage of a linked list over an array? when inserting a new item at the beginning it causes no shift to the data
ADT (Abstract data Type) data type described by predefined user operations, such as "insert data at rear", without
indication how each operation is implemented
list ADT for holding ordered data
stack ADT which items are only inserted on or removed from the top of a stack
LIFO
Queue ADT in which items are inserted at the end of the queue and removed from the front of
the queue
FIFO
deque ("deck") ADT in which items can be removed at both the front and back
Bag ADT for stroing items in which the order does not matter and duplicate items are allowed
