WGU C949 CERTIFICATION SCRIPT 2026
QUESTIONS WITH SOLUTIONS GRADED A+
◍ What is the runtime complexity for the expression 305 + O(325*N)?.
Answer: O(N)
◍ What is the result when 6 is enqueued to the queue 7,9,8 (with 7 as the
front)?.
Answer: 7,9,8,6
◍ list traversal.
Answer: An algorithm that visits all nodes in the list once and performs an
operation on each node.
◍ How many elements in a list of size 64 would be visited when using a binary
search for a number that is smallethan all the values in the list?.
Answer: 6
◍ What does a time complexity analysis of an algorithm include?.
Answer: Worst case
◍ good hash function.
Answer: This hash function should uniformly distribute items into buckets.
With chaining, it results in short bucket lists and thus fast inserts, searches,
and removes. With linear probing, it will avoid hashing multiple items to
consecutive buckets and thus minimize the average linear probing length to
achieve fast inserts, searches, and removes. On average, it will achieve O(1)
inserts, searches, and removes, but in the worst-case may require O(N).
◍ Head.
Answer: A singly-linked list's first node.
◍ Which data type do heap sorts work with?.
Answer: Tree-based data structure
,◍ What is the runtime complexity for this code?for x in range(N):for y in
range(N):for z in range(N):tot = tot + zprint tot.
Answer: O(N^3)
◍ What is a component of an algorithm that specifies a stopping point?.
Answer: Finiteness
◍ What is the midpoint given the quicksort on this list? Consider the lowindex
= 5 and highindex = 9.(43,3,72,18,2,28,51,111,66,71).
Answer: 7
◍ How many elements will be compared to linear search for 27 in this
list?[9,3,7,2,8,15,13,35,95,7,4].
Answer: 11
◍ Which search algorithm functions by continually dividing the data set in half
until the sought item is found orthe data set is exhausted?.
Answer: Binary search
◍ reverse traversal.
Answer: A list traversal that visits all nodes starting with the list's tail node
and ending after visiting the list's head node.
◍ What is the root node for this tree?.
Answer: Anne
◍ Heapify.
Answer: An operation is used to turn an array into a heap.
◍ What is referred to as a data structure that stores subitems?.
Answer: Record
◍ Which queue results from executing the following queue operations on the
queue 7,9,8 (with 7 as the front)?Dequeue ()Enqueue (6)Enqueue
(5)Dequeue ().
Answer: 8,6,5
◍ How does the insertion sort algorithm sort through a list?.
, Answer: By iterating through the sorted list while placing each value into its
correct sorted position within the list
◍ Auxiliary space complexity.
Answer: The space complexity not including the input data.
◍ Priority queue.
Answer: A queue where each item has a priority, and items with higher
priority are closer to the front of the queue than items with lower priority.
◍ Algorithm.
Answer: Describes a sequence of steps to solve a computational problem or
perform a calculation.
◍ Record.
Answer: A data structure that stores subitems, with a name associated with
each subitem.
◍ Algorithm efficiency.
Answer: Typically measured by the algorithm's computational complexity.
◍ any().
Answer: A Python function that returns True if any key of the dictionary is
true.
◍ constant time operation.
Answer: An operation that, for a given processor, always operates in the
same amount of time, regardless of input values.
◍ linear probing.
Answer: Handles a hash table collision by starting at the key's mapped
bucket, and then linearly searches subsequent buckets until an empty bucket
is found.
◍ Which function in Python is used to find a specific value in a tuple?.
Answer: index()
◍ pivot.
Answer: Any value within the array being sorted, commonly the value of the
QUESTIONS WITH SOLUTIONS GRADED A+
◍ What is the runtime complexity for the expression 305 + O(325*N)?.
Answer: O(N)
◍ What is the result when 6 is enqueued to the queue 7,9,8 (with 7 as the
front)?.
Answer: 7,9,8,6
◍ list traversal.
Answer: An algorithm that visits all nodes in the list once and performs an
operation on each node.
◍ How many elements in a list of size 64 would be visited when using a binary
search for a number that is smallethan all the values in the list?.
Answer: 6
◍ What does a time complexity analysis of an algorithm include?.
Answer: Worst case
◍ good hash function.
Answer: This hash function should uniformly distribute items into buckets.
With chaining, it results in short bucket lists and thus fast inserts, searches,
and removes. With linear probing, it will avoid hashing multiple items to
consecutive buckets and thus minimize the average linear probing length to
achieve fast inserts, searches, and removes. On average, it will achieve O(1)
inserts, searches, and removes, but in the worst-case may require O(N).
◍ Head.
Answer: A singly-linked list's first node.
◍ Which data type do heap sorts work with?.
Answer: Tree-based data structure
,◍ What is the runtime complexity for this code?for x in range(N):for y in
range(N):for z in range(N):tot = tot + zprint tot.
Answer: O(N^3)
◍ What is a component of an algorithm that specifies a stopping point?.
Answer: Finiteness
◍ What is the midpoint given the quicksort on this list? Consider the lowindex
= 5 and highindex = 9.(43,3,72,18,2,28,51,111,66,71).
Answer: 7
◍ How many elements will be compared to linear search for 27 in this
list?[9,3,7,2,8,15,13,35,95,7,4].
Answer: 11
◍ Which search algorithm functions by continually dividing the data set in half
until the sought item is found orthe data set is exhausted?.
Answer: Binary search
◍ reverse traversal.
Answer: A list traversal that visits all nodes starting with the list's tail node
and ending after visiting the list's head node.
◍ What is the root node for this tree?.
Answer: Anne
◍ Heapify.
Answer: An operation is used to turn an array into a heap.
◍ What is referred to as a data structure that stores subitems?.
Answer: Record
◍ Which queue results from executing the following queue operations on the
queue 7,9,8 (with 7 as the front)?Dequeue ()Enqueue (6)Enqueue
(5)Dequeue ().
Answer: 8,6,5
◍ How does the insertion sort algorithm sort through a list?.
, Answer: By iterating through the sorted list while placing each value into its
correct sorted position within the list
◍ Auxiliary space complexity.
Answer: The space complexity not including the input data.
◍ Priority queue.
Answer: A queue where each item has a priority, and items with higher
priority are closer to the front of the queue than items with lower priority.
◍ Algorithm.
Answer: Describes a sequence of steps to solve a computational problem or
perform a calculation.
◍ Record.
Answer: A data structure that stores subitems, with a name associated with
each subitem.
◍ Algorithm efficiency.
Answer: Typically measured by the algorithm's computational complexity.
◍ any().
Answer: A Python function that returns True if any key of the dictionary is
true.
◍ constant time operation.
Answer: An operation that, for a given processor, always operates in the
same amount of time, regardless of input values.
◍ linear probing.
Answer: Handles a hash table collision by starting at the key's mapped
bucket, and then linearly searches subsequent buckets until an empty bucket
is found.
◍ Which function in Python is used to find a specific value in a tuple?.
Answer: index()
◍ pivot.
Answer: Any value within the array being sorted, commonly the value of the
