WGU C949 DATA STRUCTURES PRACTICE
REVIEW 2026 COMPLETE SOLUTIONS
GRADED A+
⩥ record. Answer: The 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,
where each item is directly accessible by a positional index.
⩥ linked list. Answer: A data structure that stores an ordered list of items
in nodes, where each node stores data and has a pointer to the next node.
⩥ binary tree. Answer: A data structure in which each node stores data
and has up to two children, known as a left child and a right child.
⩥ hash table. Answer: A data structure that stores unordered items by
mapping (or hashing) 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 childrens' 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 childrens' keys.
⩥ graph. Answer: A data structure for representing connections among
items, and consists of vertices connected by edges.
⩥ vertex. Answer: This represents an item in a graph.
⩥ edge. Answer: This represents a connection between two vertices in a
graph.
⩥ algorithm. Answer: This describes a sequence of steps to solve a
computational problem or perform a calculation.
⩥ computational problem. Answer: This problem specifies an input, a
question about the input that can be answered using a computer, and the
desired output.
⩥ NP-complete problems. Answer: These problems are a set of problems
for which no known efficient algorithm exists, no one has proven that
finding an efficient algorithm is impossible, and finding one exists
means all problems of this kind can be solved.
REVIEW 2026 COMPLETE SOLUTIONS
GRADED A+
⩥ record. Answer: The 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,
where each item is directly accessible by a positional index.
⩥ linked list. Answer: A data structure that stores an ordered list of items
in nodes, where each node stores data and has a pointer to the next node.
⩥ binary tree. Answer: A data structure in which each node stores data
and has up to two children, known as a left child and a right child.
⩥ hash table. Answer: A data structure that stores unordered items by
mapping (or hashing) 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 childrens' 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 childrens' keys.
⩥ graph. Answer: A data structure for representing connections among
items, and consists of vertices connected by edges.
⩥ vertex. Answer: This represents an item in a graph.
⩥ edge. Answer: This represents a connection between two vertices in a
graph.
⩥ algorithm. Answer: This describes a sequence of steps to solve a
computational problem or perform a calculation.
⩥ computational problem. Answer: This problem specifies an input, a
question about the input that can be answered using a computer, and the
desired output.
⩥ NP-complete problems. Answer: These problems are a set of problems
for which no known efficient algorithm exists, no one has proven that
finding an efficient algorithm is impossible, and finding one exists
means all problems of this kind can be solved.
