WGU C949 COMPREHENSIVE STUDY GUIDE
2026 FULL QUESTIONS AND SOLUTIONS
GRADED A+
◍ Dictionary method.
Answer: D1[key].remove(value)
◍ A list node's data can store a record with multiple subitems..
Answer: True: The data stored in a list node can be a record with multiple
subitems. Ex: A linked list storing employee data might use a record
containing the employee's name, title, and salary. Also, the list node itself
can be implemented as a record, having subitems for the data and the pointer
to the next node.
◍ Graph Direction.
Answer: Undirected Graph : The graph in which all the edges are
bidirectional.Directed Graph : The graph in which all the edges are
unidirectional.
◍ A list ADT's underlying data structure has no impact on the program's
execution..
Answer: False: Different underlying data structures will require different
algorithms to perform same list ADT operation, which will have different
runtimes. Ex: For prepending an item to a list, a linked list-based
implementation is more efficient than an array-based implementation.
◍ Upper Bound.
Answer: a real number b that is greater than or equal to the greatest real zero
of a polynomial function
◍ BST inorder traversal.
Answer: Visits all nodes in a BST from smallest to largest, which is useful
, for example to print the tree's nodes in sorted order. Starting from the root,
the algorithm recursively prints the left subtree, the current node, and the
right subtree.Left -> Root -> Right
◍ O(N log N).
Answer: Linearithmic (OK case)
◍ Radix sort.
Answer: 10 buckets
◍ Hash table.
Answer: A hash table is a data structure that stores unordered items by
mapping (or hashing) each item to a location in an array
◍ Heap.
Answer: A max-heap is a tree that maintains the simple property that a
node's key is greater than or equal to the node's childrens' keys. A min-heap
is a tree that maintains the simple property that a node's key is less than or
equal to the node's childrens' keys.
◍ Hash Table.
Answer: A data structure that stores unordered items by mapping (or
hashing) each item to a location in an array (or vector). Ex: Given an array
with indices 0..9 to store integers from 0..500, the modulo (remainder)
operator can be used to map 25 to index 5 (25 % 10 = 5), and 149 to index 9
(149 % 10 = 9). A hash table's main advantage is that searching (or inserting
/ removing) an item may require only O(1), in contrast to O(N) for searching
a list or to O(log N) for binary search.
◍ Bag.
Answer: A bag is an ADT for storing items in which the order does not
matter and duplicate items are allowed. (Array, Linked List)
◍ Inserting an item at the beginning of a 999-item array requires how many
items to be shifted?.
Answer: 999: Inserting at the beginning requires making room for the new
item. So every current item must be shifted once.
, ◍ Memory allocation.
Answer: The process of an application requesting and being granted
memory.Memory used by a Python application must be granted to the
application by the operating system. When an application requests a specific
amount of memory from the operating system, the operating system can
then choose to grant or deny the request.Python does this automatically
◍ Inserting an item at the end of a 999-item linked list requires how many
items to be shifted?.
Answer: Zero: The new item is simply added to the end.
◍ Graph.
Answer: A data structure for representing connections among items, and
consists of vertices connected by edges. Graph is a data structure that
consists of following two components:A vertex (vertices) represents an item
(node) in a graph. An edge represents a connection between two vertices in
a graph.
◍ Computational complexity analysis allows the efficiency of algorithms to be
compared..
Answer: True
◍ Graph.
Answer: A graph is a data structure for representing connections among
items, and consists of vertices connected by edges. A vertex represents an
item in a graph. An edge represents a connection between two vertices in a
graph
◍ Is a "Name" considered an Identifier?.
Answer: True
◍ List.
Answer: An ADT for holding ordered data. Dups okSequence type: A
mutable container with ordered elements.Underlying data structures: Array,
linked list
2026 FULL QUESTIONS AND SOLUTIONS
GRADED A+
◍ Dictionary method.
Answer: D1[key].remove(value)
◍ A list node's data can store a record with multiple subitems..
Answer: True: The data stored in a list node can be a record with multiple
subitems. Ex: A linked list storing employee data might use a record
containing the employee's name, title, and salary. Also, the list node itself
can be implemented as a record, having subitems for the data and the pointer
to the next node.
◍ Graph Direction.
Answer: Undirected Graph : The graph in which all the edges are
bidirectional.Directed Graph : The graph in which all the edges are
unidirectional.
◍ A list ADT's underlying data structure has no impact on the program's
execution..
Answer: False: Different underlying data structures will require different
algorithms to perform same list ADT operation, which will have different
runtimes. Ex: For prepending an item to a list, a linked list-based
implementation is more efficient than an array-based implementation.
◍ Upper Bound.
Answer: a real number b that is greater than or equal to the greatest real zero
of a polynomial function
◍ BST inorder traversal.
Answer: Visits all nodes in a BST from smallest to largest, which is useful
, for example to print the tree's nodes in sorted order. Starting from the root,
the algorithm recursively prints the left subtree, the current node, and the
right subtree.Left -> Root -> Right
◍ O(N log N).
Answer: Linearithmic (OK case)
◍ Radix sort.
Answer: 10 buckets
◍ Hash table.
Answer: A hash table is a data structure that stores unordered items by
mapping (or hashing) each item to a location in an array
◍ Heap.
Answer: A max-heap is a tree that maintains the simple property that a
node's key is greater than or equal to the node's childrens' keys. A min-heap
is a tree that maintains the simple property that a node's key is less than or
equal to the node's childrens' keys.
◍ Hash Table.
Answer: A data structure that stores unordered items by mapping (or
hashing) each item to a location in an array (or vector). Ex: Given an array
with indices 0..9 to store integers from 0..500, the modulo (remainder)
operator can be used to map 25 to index 5 (25 % 10 = 5), and 149 to index 9
(149 % 10 = 9). A hash table's main advantage is that searching (or inserting
/ removing) an item may require only O(1), in contrast to O(N) for searching
a list or to O(log N) for binary search.
◍ Bag.
Answer: A bag is an ADT for storing items in which the order does not
matter and duplicate items are allowed. (Array, Linked List)
◍ Inserting an item at the beginning of a 999-item array requires how many
items to be shifted?.
Answer: 999: Inserting at the beginning requires making room for the new
item. So every current item must be shifted once.
, ◍ Memory allocation.
Answer: The process of an application requesting and being granted
memory.Memory used by a Python application must be granted to the
application by the operating system. When an application requests a specific
amount of memory from the operating system, the operating system can
then choose to grant or deny the request.Python does this automatically
◍ Inserting an item at the end of a 999-item linked list requires how many
items to be shifted?.
Answer: Zero: The new item is simply added to the end.
◍ Graph.
Answer: A data structure for representing connections among items, and
consists of vertices connected by edges. Graph is a data structure that
consists of following two components:A vertex (vertices) represents an item
(node) in a graph. An edge represents a connection between two vertices in
a graph.
◍ Computational complexity analysis allows the efficiency of algorithms to be
compared..
Answer: True
◍ Graph.
Answer: A graph is a data structure for representing connections among
items, and consists of vertices connected by edges. A vertex represents an
item in a graph. An edge represents a connection between two vertices in a
graph
◍ Is a "Name" considered an Identifier?.
Answer: True
◍ List.
Answer: An ADT for holding ordered data. Dups okSequence type: A
mutable container with ordered elements.Underlying data structures: Array,
linked list
