.png){kind=logo}
WGU C949 Data Structures and Algorithms I Exam Review (Latest 2026/2027 Update) Questions and Verified Answers| 100% Correct
WGU C949 Data Structures and Algorithms
I Exam Review (Latest 2026/2027 Update)
Questions and Verified Answers| 100%
Correct
Q: Queue
Answer:
ADT in which items are inserted at the end and removed from the front. Common data
structures: linked list
FIFO
Q: Deque ("deck")
Answer:
ADT in which items can be removed at both the front and back. Common data structures: linked
list
Q: Bag
Answer:
ADT for storing items in which the order does not matter and duplicate items are allowed.
Common data structures: array, linked list
Q: Set
Answer:
ADT for collection of distinct items
Common data structures: Binary search tree, hash table
Q: Priority Queue
Answer:
ADT where each item has a priority, and items with higher priority are closer to the front of the
queue. The earliest arrival is removed first.
Common data structures: heap
Q: Dictionary (map)
Answer:
ADT that associates (or maps) keys with values
Common data structures: hash table, binary search tree
Q: What ADTs with array, linked list have common underlying DS?
Answer:
List, Bag
Q: What ADTs have linked list as their only common underlying DS?
Answer:
Stack, Queue, Deque
Q: What is Peek?
Answer:
It allows the user to read the value at the top of the stack with out removing it.
Q: identity
Answer:
unique identifier that describes the object
Q: What is this symbol? //
Answer:
symbol for floored division
Q: What is a Tuple?
Answer:
behaves similar to a list but is immutable -- once created it can not be changed.
const array/list
Q: for i in range(0)
Answer:
Sets i to 0 during the first iteration of the for loop, i to 1 during the second iteration, and finally i
to 2 on the third iteration. The value within the parentheses is not included in the generated
sequence.
Q: range(5, -6, -1)
Answer:
code for every int from 5 down to -5
Q: range(10, 21, 2)
Answer:
code for every 2nd int from 10 to 20
Q: polymorphism
Answer:
.png)