, WGU C949 - BIG O NOTATION
COMPUTER SCIENCE DATA
STRUCTURES & ALGORITHMS
CERTIFICATION PRACTICE EXAM
QUESTIONS WITH CORRECT
ANSWERS GRADED A+ FOR 2026
ASSURED EXCEL!!
Computer Science Data Structures & Algorithms Certification Practice Exam
Sorting Algorithms, Trees, Heaps & Big-O Analysis
Multiple Choice Questions (Choose the BEST answer.)
1. What is the worst-case time complexity of Quick Sort?
A. O(log n)
B. O(n)
C. O(n log n)
D. O(n²)
2. What is the average time complexity of Merge Sort?
A. O(n²)
B. O(log n)
C. O(n)
D. O(n log n)
COMPUTER SCIENCE DATA
STRUCTURES & ALGORITHMS
CERTIFICATION PRACTICE EXAM
QUESTIONS WITH CORRECT
ANSWERS GRADED A+ FOR 2026
ASSURED EXCEL!!
Computer Science Data Structures & Algorithms Certification Practice Exam
Sorting Algorithms, Trees, Heaps & Big-O Analysis
Multiple Choice Questions (Choose the BEST answer.)
1. What is the worst-case time complexity of Quick Sort?
A. O(log n)
B. O(n)
C. O(n log n)
D. O(n²)
2. What is the average time complexity of Merge Sort?
A. O(n²)
B. O(log n)
C. O(n)
D. O(n log n)