Skip to content

Complexity Theory -- Practice Problems

Complexity Theory — Practice Problems

10 MCQ questions covering Big-O notation, complexity classes (P, NP, NP-complete), polynomial-time reductions, Cook’s theorem, and approximation algorithms. Select an option to check your answer.


Asymptotic Notation and Complexity Classes

Approximation Algorithms and Hardness