WGU C949 DATA STRUCTURES AND
ALGORITHMS FINAL TEST 2026
QUESTIONS WITH CORRECT ANSWERS
GRADED A+
◍ O(n).
Answer: What is the time complexity of this pseudocode? Algorithm
Algo1(A) Input: An array A storing n ≥ 1 integers Output: The sum of the
elements in A s=A[1] for i=1 to n do s=s+A[i] return s
◍ Peek(stack).
Answer: Returns but does not remove item at top of stack
◍ Given this data dictionary in Python: dict = {'white':0x0000,
'black':0x1111}Which command/function generates the output
['white','black']?.
Answer: dict.keys()
◍ "bird".
Answer: Items were added sequentially in this stack starting with "dog":
"bird""rabbit""cat""dog" What is the return value of the pop operation?
◍ Remove(list, x).
Answer: Removes x Remove(list, 77), list: 99
◍ Which data set is represented using the dictionary data type?.
Answer: A set of students and their test scores
◍ Priority Queue.
Answer: A priority queue is 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. (Heap)
,◍ Bag.
Answer: an ADT for storing items in which the order does not matter and
duplicate items are allowed.Ex: Array, Linked List
◍ Returns True if any key of the dictionary is true..
Answer: What does the method any(b) return in Python if b is a dictionary?
◍ braces { }.
Answer: to surround the key:value pairs that comprise the dictionary
contents. For example, { 'Lionel Messi': 10, 'Christiano Ronaldo': 7}
describes a dictionary with two keys: the football players 'Lionel Messi' and
'Christiano Ronaldo', associated with the values 10 and 7 (their respective
jersey numbers). An empty dictionary is created with the expression { }.
◍ A large set of floating point numbers that are in range from 0.0 to 1.0 and
are uniformly distributed across the range need to be sorted. Which sort
procedure is useful when the input is uniformly distributed over the range?.
Answer: Bucket
◍ Append.
Answer: inserts the new node after the list's tail node. The append algorithm
behavior differs if the list is empty versus not empty:Append to empty list:
If the list's head pointer is null (empty), the algorithm points the list's head
and tail pointers to the new node.Append to non-empty list: If the list's head
pointer is not null (not empty), the algorithm points the tail node's pointer to
the new node, points the new node's previous pointer to the list's tail node,
and points the list's tail pointer to the new node.
◍ What is the typical run time for an insertion sort?.
Answer: O(n^2)
◍ all(list).
Answer: True if every element in list is True (!= 0), or if the list is empty.
◍ 10.
Answer: How many buckets are needed when sorting 13 numbers that have
, 15 digits each, using the radix-sort algorithm?
◍ bucket.
Answer: Each hash table array element is called a
◍ What is a characteristic of quick sort?.
Answer: Recursively breaks down a problem into two or more subproblems
of the same or related type
◍ Radix Sort Algorithm.
Answer: A version of bucket sort that starts by sorting the least significant
digit on the first pass, the next least significant digit on the second pass, and
so on for all place values.Two steps are needed for each digit. First, all array
elements are placed into buckets based on the current digit's value. Then, the
array is rebuilt by removing all elements from buckets, in order from lowest
bucket to highest.
◍ A B C D F E G I H.
Answer: Which sequence of letters represents preorder traversal of the nodes
of this tree? A / \ B C / \ / \ D E \ / \ F G H / I
◍ list.count(val).
Answer: Count the number of occurrences of the value val in list.
◍ Which type of sorting algorithm is demonstrated in this pseudocode?for i
from 0 to N - 1 if a[i] > a[i + 1] swap( a[i], a[i + 1])end.
Answer: Bubble
◍ 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
◍ What is the time complexity of the instructions in this pseudocode?for (i =
0; i < N; i++){ for (j = i+1; j < N; j++) { ... // sequence of statements that do
not alter N }}.
Answer: O(N^2)
◍ 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.
◍ In soc[5].
Answer: An array soc of size 1009 is used where the index is an integer in
[0,1008] and the hash-function key%1009. Where will the data associated
with the key given by the last 4 social security digits ‘2023’ be stored?
◍ bucket index.
Answer: is calculated as number N/M+1 . Then, each bucket is sorted
with an additional sorting algorithm. Lastly, all buckets are concatenated
together in order, and copied to the original array.
◍ What is the time complexity of this pseudocode? double sumCol(double
table[][], int numRows, int numCols, int col){ double cSum = 0; for (int row
= 0; row < numRows; row++) { cSum += table[row][col]; } return cSum;}.
Answer: O(n)
◍ IsEmpty(list).
Answer: Returns true if list has no items For list 99, 77, IsEmpty(list) returns
false
◍ Space Complexity Formula.
Answer: S(N)
◍ Base Case.
Answer: A case where a recursive algorithm completes without applying
itself to a smaller subproblem.
◍ shell sort.
Answer: Starts by sorting pairs of elements far apart from each other, then
progressively reducing the gap between elements to be compared. Starting
with far apart elements can move some out-of-place elements into position
faster than a simple nearest neighbor exchange.
ALGORITHMS FINAL TEST 2026
QUESTIONS WITH CORRECT ANSWERS
GRADED A+
◍ O(n).
Answer: What is the time complexity of this pseudocode? Algorithm
Algo1(A) Input: An array A storing n ≥ 1 integers Output: The sum of the
elements in A s=A[1] for i=1 to n do s=s+A[i] return s
◍ Peek(stack).
Answer: Returns but does not remove item at top of stack
◍ Given this data dictionary in Python: dict = {'white':0x0000,
'black':0x1111}Which command/function generates the output
['white','black']?.
Answer: dict.keys()
◍ "bird".
Answer: Items were added sequentially in this stack starting with "dog":
"bird""rabbit""cat""dog" What is the return value of the pop operation?
◍ Remove(list, x).
Answer: Removes x Remove(list, 77), list: 99
◍ Which data set is represented using the dictionary data type?.
Answer: A set of students and their test scores
◍ Priority Queue.
Answer: A priority queue is 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. (Heap)
,◍ Bag.
Answer: an ADT for storing items in which the order does not matter and
duplicate items are allowed.Ex: Array, Linked List
◍ Returns True if any key of the dictionary is true..
Answer: What does the method any(b) return in Python if b is a dictionary?
◍ braces { }.
Answer: to surround the key:value pairs that comprise the dictionary
contents. For example, { 'Lionel Messi': 10, 'Christiano Ronaldo': 7}
describes a dictionary with two keys: the football players 'Lionel Messi' and
'Christiano Ronaldo', associated with the values 10 and 7 (their respective
jersey numbers). An empty dictionary is created with the expression { }.
◍ A large set of floating point numbers that are in range from 0.0 to 1.0 and
are uniformly distributed across the range need to be sorted. Which sort
procedure is useful when the input is uniformly distributed over the range?.
Answer: Bucket
◍ Append.
Answer: inserts the new node after the list's tail node. The append algorithm
behavior differs if the list is empty versus not empty:Append to empty list:
If the list's head pointer is null (empty), the algorithm points the list's head
and tail pointers to the new node.Append to non-empty list: If the list's head
pointer is not null (not empty), the algorithm points the tail node's pointer to
the new node, points the new node's previous pointer to the list's tail node,
and points the list's tail pointer to the new node.
◍ What is the typical run time for an insertion sort?.
Answer: O(n^2)
◍ all(list).
Answer: True if every element in list is True (!= 0), or if the list is empty.
◍ 10.
Answer: How many buckets are needed when sorting 13 numbers that have
, 15 digits each, using the radix-sort algorithm?
◍ bucket.
Answer: Each hash table array element is called a
◍ What is a characteristic of quick sort?.
Answer: Recursively breaks down a problem into two or more subproblems
of the same or related type
◍ Radix Sort Algorithm.
Answer: A version of bucket sort that starts by sorting the least significant
digit on the first pass, the next least significant digit on the second pass, and
so on for all place values.Two steps are needed for each digit. First, all array
elements are placed into buckets based on the current digit's value. Then, the
array is rebuilt by removing all elements from buckets, in order from lowest
bucket to highest.
◍ A B C D F E G I H.
Answer: Which sequence of letters represents preorder traversal of the nodes
of this tree? A / \ B C / \ / \ D E \ / \ F G H / I
◍ list.count(val).
Answer: Count the number of occurrences of the value val in list.
◍ Which type of sorting algorithm is demonstrated in this pseudocode?for i
from 0 to N - 1 if a[i] > a[i + 1] swap( a[i], a[i + 1])end.
Answer: Bubble
◍ 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
◍ What is the time complexity of the instructions in this pseudocode?for (i =
0; i < N; i++){ for (j = i+1; j < N; j++) { ... // sequence of statements that do
not alter N }}.
Answer: O(N^2)
◍ 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.
◍ In soc[5].
Answer: An array soc of size 1009 is used where the index is an integer in
[0,1008] and the hash-function key%1009. Where will the data associated
with the key given by the last 4 social security digits ‘2023’ be stored?
◍ bucket index.
Answer: is calculated as number N/M+1 . Then, each bucket is sorted
with an additional sorting algorithm. Lastly, all buckets are concatenated
together in order, and copied to the original array.
◍ What is the time complexity of this pseudocode? double sumCol(double
table[][], int numRows, int numCols, int col){ double cSum = 0; for (int row
= 0; row < numRows; row++) { cSum += table[row][col]; } return cSum;}.
Answer: O(n)
◍ IsEmpty(list).
Answer: Returns true if list has no items For list 99, 77, IsEmpty(list) returns
false
◍ Space Complexity Formula.
Answer: S(N)
◍ Base Case.
Answer: A case where a recursive algorithm completes without applying
itself to a smaller subproblem.
◍ shell sort.
Answer: Starts by sorting pairs of elements far apart from each other, then
progressively reducing the gap between elements to be compared. Starting
with far apart elements can move some out-of-place elements into position
faster than a simple nearest neighbor exchange.
