3. Algorithms

Complexity Theory — Quiz

Test your understanding of complexity theory with 5 practice questions.

Read the lesson first

Practice Questions

Question 1

Which of the following best describes the class P in complexity theory?

Question 2

What does it mean for a problem to be in NP?

Question 3

Which of the following is an example of a problem believed to be in NP but not in P?

Question 4

Which statement is true about the relationship between P and NP?

Question 5

What is an NP-complete problem?
Complexity Theory Quiz — AS-Level Computer Science | A-Warded