WGU C949 DATA STRUCTURES AND
ALGORITHMS ACTUAL EXAM PAPER 2026
QUESTIONS WITH ANSWERS GRADED A+
◍ Which term refers to a template for creating an object?.
Answer: Class
◍ sorted().
Answer: function that takes one list argument, sorts the list's elements in
ascending order using the less than (<) operator, and returns a new list with
the sorted elements.
◍ self-adjusting heuristic.
Answer: modifies based on how data is used
◍ graph.
Answer: connections w vertices and edges
◍ stack.
Answer: LIFO ADT
◍ What is x in the following block of logic? x=28 If x >= 10 and x < 20 x =
20elif x <= 30 x = 25elif x >= 50 x = 100else x = 500.
Answer: 25
◍ longest common substring.
Answer: longest common sub-part of two strings
◍ set.
Answer: distinct items ADT
◍ dynamic array.
Answer: variable-size, ordered data and indexed access ADT
,◍ list.
Answer: ordered data ADT
◍ deque.
Answer: double-ended ADT
◍ vertex.
Answer: item in graph
◍ Array:.
Answer: -Ordered and indexed collection of elements-Fixed-size
(Python)-Stored in contiguous memory locations-used when we require
random access to elements; when insertion & deletion are infrequent O(n)
◍ dynamic programming.
Answer: uses computer memory to avoid recomputing previously computed
results
◍ algorithm.
Answer: sequence of steps to solve problem
◍ Array-Based List.
Answer: A list ADT implemented using an array.
◍ heuristic.
Answer: speed prioritized over optimization and accuracy
◍ Priority Queue.
Answer: An ADT where items are inserted at the end, and removed from the
front. Each item has a priority, and items with a higher priority are closer to
the front.
◍ Mapping Data Type.
Answer: A data type used exclusively by the dict type. Each element is
independent, which means there is no special ordering. Also uses key value
pairs to associate a key with a value.
◍ computational problem.
Answer: input, question, desired output
,◍ greedy algorithm.
Answer: optimize based on now
◍ record.
Answer: fields w names
◍ longest common substring.
Answer: The longest common substring algorithm operates on two strings of
length N and M. For each of the N characters in the first string, M matrix
entries are computed, making the runtime complexity O(N•M). Since an N x
M integer matrix is built, the space complexity is also O(N•M).
◍ Asymptotic notation.
Answer: is the classification of runtime complexity that uses functions that
indicate only the growth rate of a bounding function.
◍ Push(stack, x).
Answer: Inserts x on top of stackPush(stack, 44). Stack: 44, 99, 77
◍ What is an Advantage That a Linked List Has Over an Array?.
Answer: Grows and shrinks as needed
◍ NP-complete.
Answer: problems w no known efficient solution
◍ array.
Answer: elements ordered by index
◍ Null.
Answer: A special value indicating a pointer points to nothing.
◍ Basic Data Structures.
Answer: -Record-Array-Linked List-Binary Tree-Hash table-Heap-Graph
◍ knapsack problem.
Answer: item selection optimization problem
◍ depth.
Answer: the number of edges on the path from the root to the node. The root
, node thus has depth 0.
◍ bag.
Answer: unordered ADT, including duplicates
◍ Binary space partitioning.
Answer: is a technique of repeatedly separating a region of space into 2 parts
and cataloging objects contained within the regions.
◍ priority queue.
Answer: priority ordered items ADT
◍ What is the Midpoint Given the Quicksort on this List? (43, 3, 72, 18, 2, 28,
51, 111, 66, 71).
Answer: 7
◍ dynamic set.
Answer: a set that can change after being constructed.
◍ data structure.
Answer: a way of organizing, storing, and performing operations on data.
◍ Huffman coding.
Answer: binary tree compression technique
◍ Space Complexity.
Answer: A function, S(N), that represents the number of fixed-size memory
units used by the algorithm for the input of size N.
◍ edge.
Answer: connection in graph
◍ AVL Tree.
Answer: a BST with a height balance property and specific operations to
rebalance the tree when a node is inserted or removed.
◍ heap.
Answer: tree for sorting or prioritizing
◍ What will be the new state of the queue 7,9,8 (with 7 as the front) after the
ALGORITHMS ACTUAL EXAM PAPER 2026
QUESTIONS WITH ANSWERS GRADED A+
◍ Which term refers to a template for creating an object?.
Answer: Class
◍ sorted().
Answer: function that takes one list argument, sorts the list's elements in
ascending order using the less than (<) operator, and returns a new list with
the sorted elements.
◍ self-adjusting heuristic.
Answer: modifies based on how data is used
◍ graph.
Answer: connections w vertices and edges
◍ stack.
Answer: LIFO ADT
◍ What is x in the following block of logic? x=28 If x >= 10 and x < 20 x =
20elif x <= 30 x = 25elif x >= 50 x = 100else x = 500.
Answer: 25
◍ longest common substring.
Answer: longest common sub-part of two strings
◍ set.
Answer: distinct items ADT
◍ dynamic array.
Answer: variable-size, ordered data and indexed access ADT
,◍ list.
Answer: ordered data ADT
◍ deque.
Answer: double-ended ADT
◍ vertex.
Answer: item in graph
◍ Array:.
Answer: -Ordered and indexed collection of elements-Fixed-size
(Python)-Stored in contiguous memory locations-used when we require
random access to elements; when insertion & deletion are infrequent O(n)
◍ dynamic programming.
Answer: uses computer memory to avoid recomputing previously computed
results
◍ algorithm.
Answer: sequence of steps to solve problem
◍ Array-Based List.
Answer: A list ADT implemented using an array.
◍ heuristic.
Answer: speed prioritized over optimization and accuracy
◍ Priority Queue.
Answer: An ADT where items are inserted at the end, and removed from the
front. Each item has a priority, and items with a higher priority are closer to
the front.
◍ Mapping Data Type.
Answer: A data type used exclusively by the dict type. Each element is
independent, which means there is no special ordering. Also uses key value
pairs to associate a key with a value.
◍ computational problem.
Answer: input, question, desired output
,◍ greedy algorithm.
Answer: optimize based on now
◍ record.
Answer: fields w names
◍ longest common substring.
Answer: The longest common substring algorithm operates on two strings of
length N and M. For each of the N characters in the first string, M matrix
entries are computed, making the runtime complexity O(N•M). Since an N x
M integer matrix is built, the space complexity is also O(N•M).
◍ Asymptotic notation.
Answer: is the classification of runtime complexity that uses functions that
indicate only the growth rate of a bounding function.
◍ Push(stack, x).
Answer: Inserts x on top of stackPush(stack, 44). Stack: 44, 99, 77
◍ What is an Advantage That a Linked List Has Over an Array?.
Answer: Grows and shrinks as needed
◍ NP-complete.
Answer: problems w no known efficient solution
◍ array.
Answer: elements ordered by index
◍ Null.
Answer: A special value indicating a pointer points to nothing.
◍ Basic Data Structures.
Answer: -Record-Array-Linked List-Binary Tree-Hash table-Heap-Graph
◍ knapsack problem.
Answer: item selection optimization problem
◍ depth.
Answer: the number of edges on the path from the root to the node. The root
, node thus has depth 0.
◍ bag.
Answer: unordered ADT, including duplicates
◍ Binary space partitioning.
Answer: is a technique of repeatedly separating a region of space into 2 parts
and cataloging objects contained within the regions.
◍ priority queue.
Answer: priority ordered items ADT
◍ What is the Midpoint Given the Quicksort on this List? (43, 3, 72, 18, 2, 28,
51, 111, 66, 71).
Answer: 7
◍ dynamic set.
Answer: a set that can change after being constructed.
◍ data structure.
Answer: a way of organizing, storing, and performing operations on data.
◍ Huffman coding.
Answer: binary tree compression technique
◍ Space Complexity.
Answer: A function, S(N), that represents the number of fixed-size memory
units used by the algorithm for the input of size N.
◍ edge.
Answer: connection in graph
◍ AVL Tree.
Answer: a BST with a height balance property and specific operations to
rebalance the tree when a node is inserted or removed.
◍ heap.
Answer: tree for sorting or prioritizing
◍ What will be the new state of the queue 7,9,8 (with 7 as the front) after the
