WGU C949 Data Structures and Algorithms I
OA| Objective Assessment
Section A: Algorithm Analysis
Q1. Which of the following best describes Big-O notation?
A. Worst-case growth rate
B. Average-case growth rate
C. Exact runtime of an algorithm
D. Best-case growth rate
Q2. What is the time complexity of binary search on a sorted array?
A. O(n)
B. O(log n)
C. O(n log n)
D. O(1)
Q3. Which complexity class represents constant time?
A. O(1)
B. O(log n)
C. O(n)
D. O(n²)
Section B: Sorting & Searching
Q4. Which sorting algorithm is stable and runs in O(n log n) average time?
A. QuickSort
B. MergeSort
C. HeapSort
D. Selection Sort
Q5. What is the best-case time complexity of QuickSort?
A. O(n log n)
B. O(n²)
C. O(log n)
D. O(n)
Section C: Data Structures
Q6. Which data structure is most efficient for FIFO operations?
A. Stack
B. Queue
C. Linked List
, D. Hash Table
Q7. Which tree structure guarantees logarithmic height?
A. Binary Search Tree
B. AVL Tree
C. Heap
D. Trie
Q8. A hash table with a poor hash function suffers from:
A. Collisions
B. Increased memory usage
C. Slow insertion
D. Lack of determinism
Section D: Graphs
Q9. Which algorithm finds the shortest path in a weighted graph with non-negative
edges?
A. BFS
B. DFS
C. Dijkstra’s Algorithm
D. Kruskal’s Algorithm
Q10. Which algorithm is used to find a minimum spanning tree?
A. Dijkstra’s
B. Prim’s
C. Bellman-Ford
D. Floyd-Warshall
Section E: Recursion & Dynamic Programming
Q11. The Fibonacci sequence implemented recursively has what time complexity?
A. O(n)
B. O(log n)
C. O(2^n)
D. O(n²)
Q12. Dynamic programming improves recursive algorithms by:
A. Eliminating recursion
B. Storing subproblem results
C. Using divide-and-conquer
D. Reducing memory usage
Section F: Cloud Computing Standards
Q13. According to NIST 800-145, cloud computing must include:
A. Virtualization only
OA| Objective Assessment
Section A: Algorithm Analysis
Q1. Which of the following best describes Big-O notation?
A. Worst-case growth rate
B. Average-case growth rate
C. Exact runtime of an algorithm
D. Best-case growth rate
Q2. What is the time complexity of binary search on a sorted array?
A. O(n)
B. O(log n)
C. O(n log n)
D. O(1)
Q3. Which complexity class represents constant time?
A. O(1)
B. O(log n)
C. O(n)
D. O(n²)
Section B: Sorting & Searching
Q4. Which sorting algorithm is stable and runs in O(n log n) average time?
A. QuickSort
B. MergeSort
C. HeapSort
D. Selection Sort
Q5. What is the best-case time complexity of QuickSort?
A. O(n log n)
B. O(n²)
C. O(log n)
D. O(n)
Section C: Data Structures
Q6. Which data structure is most efficient for FIFO operations?
A. Stack
B. Queue
C. Linked List
, D. Hash Table
Q7. Which tree structure guarantees logarithmic height?
A. Binary Search Tree
B. AVL Tree
C. Heap
D. Trie
Q8. A hash table with a poor hash function suffers from:
A. Collisions
B. Increased memory usage
C. Slow insertion
D. Lack of determinism
Section D: Graphs
Q9. Which algorithm finds the shortest path in a weighted graph with non-negative
edges?
A. BFS
B. DFS
C. Dijkstra’s Algorithm
D. Kruskal’s Algorithm
Q10. Which algorithm is used to find a minimum spanning tree?
A. Dijkstra’s
B. Prim’s
C. Bellman-Ford
D. Floyd-Warshall
Section E: Recursion & Dynamic Programming
Q11. The Fibonacci sequence implemented recursively has what time complexity?
A. O(n)
B. O(log n)
C. O(2^n)
D. O(n²)
Q12. Dynamic programming improves recursive algorithms by:
A. Eliminating recursion
B. Storing subproblem results
C. Using divide-and-conquer
D. Reducing memory usage
Section F: Cloud Computing Standards
Q13. According to NIST 800-145, cloud computing must include:
A. Virtualization only
