C949 WGU Terms
C949 WGU Containing 122 Terms &
Definitions 2024.
Record - Answer: Data structure that stores subitems, often called fields, with a
name associated with each subitem.
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
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.
, C949 WGU Terms
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.
Each node can have only 0, 1 or 2 leaf nodes. All left nodes and all of its
descendants have smaller values that the root node, while all right nodes and all
of its descendants have larger values than the root node.
Hash table - Answer: Data structure that stores *unordered* items by mapping
each item to a location in an array.
max-heap - Answer: A tree that maintains the simple property that a node's key is
greater than or equal to the node's children's keys.
min-heap - Answer: A tree that maintains the simple property that a node's key is
less than or equal to the node's children's keys.
graph - Answer: data structure for representing connections among items, and
consists of vertices connected by edges.
vertice - Answer: part of a graph the represents an item in a graph.
edge - Answer: Part of a graph that represents a connection between to vertices
in a graph. (Line between nodes)
, C949 WGU Terms
what is an advantage of a linked list over an array? - Answer: When inserting a
new item at the beginning, the data does not shift.
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
list - Answer: ADT for holding ordered data.
Common data structures: array, linked list
stack - Answer: ADT in which items are only inserted or removed from the top.
Common data structures: linked list
LIFO
Queue - Answer: ADT in which items are inserted at the end and removed from
the front.
Common data structures: linked list
FIFO
Deque ("deck") - Answer: ADT in which items can be removed at both the front
and back.
Common data structures: linked list
Bag - Answer: ADT for storing items in which the order does not matter and
duplicate items are allowed.
C949 WGU Containing 122 Terms &
Definitions 2024.
Record - Answer: Data structure that stores subitems, often called fields, with a
name associated with each subitem.
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
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.
, C949 WGU Terms
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.
Each node can have only 0, 1 or 2 leaf nodes. All left nodes and all of its
descendants have smaller values that the root node, while all right nodes and all
of its descendants have larger values than the root node.
Hash table - Answer: Data structure that stores *unordered* items by mapping
each item to a location in an array.
max-heap - Answer: A tree that maintains the simple property that a node's key is
greater than or equal to the node's children's keys.
min-heap - Answer: A tree that maintains the simple property that a node's key is
less than or equal to the node's children's keys.
graph - Answer: data structure for representing connections among items, and
consists of vertices connected by edges.
vertice - Answer: part of a graph the represents an item in a graph.
edge - Answer: Part of a graph that represents a connection between to vertices
in a graph. (Line between nodes)
, C949 WGU Terms
what is an advantage of a linked list over an array? - Answer: When inserting a
new item at the beginning, the data does not shift.
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
list - Answer: ADT for holding ordered data.
Common data structures: array, linked list
stack - Answer: ADT in which items are only inserted or removed from the top.
Common data structures: linked list
LIFO
Queue - Answer: ADT in which items are inserted at the end and removed from
the front.
Common data structures: linked list
FIFO
Deque ("deck") - Answer: ADT in which items can be removed at both the front
and back.
Common data structures: linked list
Bag - Answer: ADT for storing items in which the order does not matter and
duplicate items are allowed.
