1 | Page
C949 WGU Terminology Questions and
Answers
record
Ans: data structure that stores subitems, with a name associated with
each subitem
array
Ans: 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
Ans: 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
binary tree
Ans: 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
hash table
Ans: data structure that stores *unordered* items by mapping (or
hashing) each item to a location in an array
max-heap
© 2025 All rights reserved
, 2 | Page
Ans: 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
Ans: a tree that maintains the simple property that a node's key is less
than or equal to the node's childrens' keys
graph
Ans: data structure for representing connections among items, and
consists of vertices connected by edges
vertice
Ans: part of a graph the represents an item in a graph
edge
Ans: 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?
Ans: when inserting a new item at the beginning it causes no shift to the
data
ADT (Abstract data Type)
Ans: data type described by predefined user operations, such as "insert
data at rear", without indication how each operation is implemented
list
Ans: ADT for holding ordered data
stack
© 2025 All rights reserved
C949 WGU Terminology Questions and
Answers
record
Ans: data structure that stores subitems, with a name associated with
each subitem
array
Ans: 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
Ans: 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
binary tree
Ans: 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
hash table
Ans: data structure that stores *unordered* items by mapping (or
hashing) each item to a location in an array
max-heap
© 2025 All rights reserved
, 2 | Page
Ans: 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
Ans: a tree that maintains the simple property that a node's key is less
than or equal to the node's childrens' keys
graph
Ans: data structure for representing connections among items, and
consists of vertices connected by edges
vertice
Ans: part of a graph the represents an item in a graph
edge
Ans: 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?
Ans: when inserting a new item at the beginning it causes no shift to the
data
ADT (Abstract data Type)
Ans: data type described by predefined user operations, such as "insert
data at rear", without indication how each operation is implemented
list
Ans: ADT for holding ordered data
stack
© 2025 All rights reserved
