- Study guides, Class notes & Summaries

WGU C950 Data Structures and Algorithms II – practice exam

-

18 pages

Written in 2023/2024

Grade A+

smartzone

WGU C950 Data Structures and Algorithms II: Exam 1 Questions with Correct Answers 100 questions 1. If f(n) = 100n and g(n) = n^2, for large n: A. f grows faster than g B. They grow equally C. g grows faster than f D. Neither grows Correct Answer: C. g grows faster than f Rationale: Quadratic dominates. 2. An algorithm that processes each pair of n items once has complexity about: A. O(n^2) B. O(n) C. O(log n) D. O(1) Correct Answer: A. O(n^2) Rationale: n(n-1)/2 pairs. 3. Compu...

-

17 pages

Written in 2026/2027

Grade A+

TheePlug

WGU C950 Data Structures and Algorithms II: Midterm Exam (Units 1-7) - Questions with Correct Answers 4 Exam (elaborations) WGU C950 Data Structures and Algorithms II: Exam 1 Questions with Correct Answers 5 Exam (elaborations) WGU C950 Data Structures and Algorithms II: Exam 2 Questions with Correct Answers

-

5 items

TheePlug

WGU C950 Data Structures and Algorithms II: Practice Test 1 (Units 1-7) - Questions with Correct Answers 100 questions 1. O(log n) algorithms typically: A. Check every element B. Compare every pair C. Generate all subsets D. Divide the problem in half at each step Correct Answer: D. Divide the problem in half at each step Rationale: Halving. 2. Generating all subsets of n items has complexity: A. O(n) B. O(2^n) C. O(n^2) D. O(log n) Correct Answer: B. O(2^n) Rationale: Power set....

-

17 pages

Written in 2026/2027

Grade A+

TheePlug

WGU C950 Data Structures and Algorithms II: Exam 3 Questions with Correct Answers 2 Exam (elaborations) WGU C950 Data Structures and Algorithms II: Final Exam (Comprehensive) - Questions with Correct Answers 3 Exam (elaborations) WGU C950 Data Structures and Algorithms II: Midterm Exam (Units 1-7) - Questions with Correct Answers 4 Exam (elaboratio

-

7 items

TheePlug

WGU C950 Data Structures and Algorithms II: Exam 2 Questions with Correct Answers 100 questions 1. The 'n' in Big-O analysis represents: A. The number of programmers B. The speed of the CPU C. A constant D. The size of the input Correct Answer: D. The size of the input Rationale: Input size. 2. Appending to the end of a Python list is: A. O(n) always B. O(log n) C. O(n^2) D. Amortized O(1) Correct Answer: D. Amortized O(1) Rationale: Occasional resize. 3. Checking members...

-

17 pages

Written in 2026/2027

Grade A+

TheePlug

WGU C950 Data Structures and Algorithms II: Practice Test 2 (Units 8-13) - Questions with Correct Answers 100 questions 1. Path reconstruction in Dijkstra's algorithm uses: A. A second graph B. Sorting C. Hashing only D. A predecessor (previous) array or map Correct Answer: D. A predecessor (previous) array or map Rationale: Backtrack from target. 2. Shortest path problems with time windows (deliveries must arrive by deadlines) are: A. Simpler than plain shortest path B. Solved by...

-

17 pages

Written in 2026/2027

Grade A+

TheePlug

WGU C950 Data Structures and Algorithms II: Midterm Exam (Units 1-7) - Questions with Correct Answers 100 questions 1. Big-O analysis helps a developer: A. Choose variable names B. Format output C. Predict how a program will scale as data grows D. Write comments Correct Answer: C. Predict how a program will scale as data grows Rationale: Scalability. 2. Two nested loops that each run n times give a complexity of: A. O(n) B. O(2n) C. O(n^2) D. O(log n) Correct Answer: C. O(n^2) Ra...

-

17 pages

Written in 2026/2027

Grade A+

TheePlug

WGU C950 Data Structures and Algorithms II: Final Exam (Comprehensive) - Questions with Correct Answers 100 questions 1. Chaining is often preferred over open addressing when: A. Memory is extremely limited B. Keys never collide C. The load factor may exceed 1 or deletions are frequent D. The table is tiny Correct Answer: C. The load factor may exceed 1 or deletions are frequent Rationale: Flexibility. 2. A bucket implemented as a Python list of [key, value] pairs supports: A. Open ad...

-

17 pages

Written in 2026/2027

Grade A+

TheePlug

WGU C950 Data Structures and Algorithms II: Exam 3 Questions with Correct Answers 100 questions 1. A function that calls itself twice per call with input n-1 (like naive Fibonacci) has complexity about: A. O(n) B. O(2^n) C. O(log n) D. O(n^2) Correct Answer: B. O(2^n) Rationale: Exponential recursion tree. 2. The lower bound for comparison-based sorting in the worst case is: A. Omega(n) B. Omega(n log n) C. Omega(1) D. Omega(n^2) Correct Answer: B. Omega(n log n) Rationale: Dec...

-

17 pages

Written in 2026/2027

Grade A+

TheePlug

WGU C950 Data Structures and Algorithms II 2023

-

6 pages

Written in 2023/2024

Grade A+

smartzone