C949 WGU Terminology
record - ANSWER -data structure that maintains the simple property that a node's
stores subitems, with a name associated key is less than or equal to the node's
with each subitem childrens' keys
array - ANSWER -a data structure that graph - ANSWER -data structure for
stores an ordered list of items, with each representing connections among items, and
item is directly accessible by a positional consists of vertices connected by edges
index
homogeneous data elements vertice - ANSWER -part of a graph the
represents an item in a graph
linked list - ANSWER -data structure
that stores *ordered* list of items in nodes, edge - ANSWER -part of a graph that
where each node stores data and has a represents a connection between to vertices
pointer to the next node; can have multiple in a graph
subitems
what is an advantage of a linked list over an
binary tree - ANSWER -A data structure array? - ANSWER -when inserting a new
that consists of nodes, with one root node at item at the beginning it causes no shift to the
the base of the tree, and two nodes (left child data
and right child) extending from the root, and
from each child node
ADT (Abstract data Type) - ANSWER -
can have no children, single left or right, or data type described by predefined user
both right and left operations, such as "insert data at rear",
without indication how each operation is
implemented
hash table - ANSWER -data structure
that stores *unordered* items by mapping (or
hashing) each item to a location in an array list - ANSWER -ADT for holding ordered
data
max-heap - ANSWER -a tree that
maintains the simple property that a node's stack - ANSWER -ADT which items are
key is greater than or equal to the node's only inserted on or removed from the top of a
childrens' keys stack
LIFO
min-heap - ANSWER -a tree that
1/6
, C949 WGU Terminology
Queue - ANSWER -ADT in which items
are inserted at the end of the queue and Stack, Queue, Deque - ANSWER -ADTs
removed from the front of the queue with linked list as their only common
underlying DS
FIFO
Peek - ANSWER -ADT operation for a
deque ("deck") - ANSWER -ADT in queue that returns but does not remove item
which items can be removed at both the front at the front of the queue
and back
identity - ANSWER -unique identifier
Bag - ANSWER -ADT for stroing items in that describes the object
which the order does not matter and
duplicate items are allowed
// - ANSWER -symbol for floored
division
Set - ANSWER -ADT for collection of
distinct items
tuple - ANSWER -behaves similar to a
common underlying DS: Binary search tree, list but is immutable -- once created the els
hash table can not be chagned
const array/list
Priority Queue - ANSWER -a queue in
which the highest-priority elements are
removed first; within a priority value, the for i in range(0) - ANSWER -sets i to 0
earliest arrival is removed first. during the first iteration of the for loop, i to 1
during the second iteration, and finally i to 2
common underlying DS: heap on the third iteration. The value within the
parentheses is not included in the generated
sequence.
Dictionary (map) - ANSWER -ADT that
associates (or maps) keys with values
range(5, -6, -1) - ANSWER -code for
common underlying DS: has table, binary every int form 5 down to -5
search tree
range(10, 21, 2) - ANSWER -code for
List, Bag - ANSWER -ADTs with array, every 2nd int from 10 to 20
linked list as common underlying DS
2/6
record - ANSWER -data structure that maintains the simple property that a node's
stores subitems, with a name associated key is less than or equal to the node's
with each subitem childrens' keys
array - ANSWER -a data structure that graph - ANSWER -data structure for
stores an ordered list of items, with each representing connections among items, and
item is directly accessible by a positional consists of vertices connected by edges
index
homogeneous data elements vertice - ANSWER -part of a graph the
represents an item in a graph
linked list - ANSWER -data structure
that stores *ordered* list of items in nodes, edge - ANSWER -part of a graph that
where each node stores data and has a represents a connection between to vertices
pointer to the next node; can have multiple in a graph
subitems
what is an advantage of a linked list over an
binary tree - ANSWER -A data structure array? - ANSWER -when inserting a new
that consists of nodes, with one root node at item at the beginning it causes no shift to the
the base of the tree, and two nodes (left child data
and right child) extending from the root, and
from each child node
ADT (Abstract data Type) - ANSWER -
can have no children, single left or right, or data type described by predefined user
both right and left operations, such as "insert data at rear",
without indication how each operation is
implemented
hash table - ANSWER -data structure
that stores *unordered* items by mapping (or
hashing) each item to a location in an array list - ANSWER -ADT for holding ordered
data
max-heap - ANSWER -a tree that
maintains the simple property that a node's stack - ANSWER -ADT which items are
key is greater than or equal to the node's only inserted on or removed from the top of a
childrens' keys stack
LIFO
min-heap - ANSWER -a tree that
1/6
, C949 WGU Terminology
Queue - ANSWER -ADT in which items
are inserted at the end of the queue and Stack, Queue, Deque - ANSWER -ADTs
removed from the front of the queue with linked list as their only common
underlying DS
FIFO
Peek - ANSWER -ADT operation for a
deque ("deck") - ANSWER -ADT in queue that returns but does not remove item
which items can be removed at both the front at the front of the queue
and back
identity - ANSWER -unique identifier
Bag - ANSWER -ADT for stroing items in that describes the object
which the order does not matter and
duplicate items are allowed
// - ANSWER -symbol for floored
division
Set - ANSWER -ADT for collection of
distinct items
tuple - ANSWER -behaves similar to a
common underlying DS: Binary search tree, list but is immutable -- once created the els
hash table can not be chagned
const array/list
Priority Queue - ANSWER -a queue in
which the highest-priority elements are
removed first; within a priority value, the for i in range(0) - ANSWER -sets i to 0
earliest arrival is removed first. during the first iteration of the for loop, i to 1
during the second iteration, and finally i to 2
common underlying DS: heap on the third iteration. The value within the
parentheses is not included in the generated
sequence.
Dictionary (map) - ANSWER -ADT that
associates (or maps) keys with values
range(5, -6, -1) - ANSWER -code for
common underlying DS: has table, binary every int form 5 down to -5
search tree
range(10, 21, 2) - ANSWER -code for
List, Bag - ANSWER -ADTs with array, every 2nd int from 10 to 20
linked list as common underlying DS
2/6
