Skip to content

University CS Practice: Algorithms

University CS — Algorithms Practice Problems

10 MCQ questions covering algorithm design paradigms, complexity analysis, divide-and-conquer, dynamic programming, greedy algorithms, and amortized analysis. Select an option to check your answer and view the explanation.


Algorithm Design Paradigms and Complexity

Divide and Conquer and Dynamic Programming

Greedy Algorithms and Amortized Analysis