Practice Intractability And Provably Hard Problems (1.5.6)

Practise this section

10 questions

Flashcard drill
3 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
4 questions · about 3 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
Define intractability in your own words.
Show hintHide hint
Think about algorithm efficiency.
Question 2.
What class of problems do we group NP-complete problems into?
Show hintHide hint
Reflect on problem classifications.
3Question 3.
What defines an intractable problem?
- A problem with a known efficient solution
- A problem without an efficient known solution
- A trivial problem
Show hintHide hint
Think about algorithm classifications.
4Question 4.
True or False: All NP-complete problems can be solved in polynomial time.
- True
- False
Show hintHide hint
Reflect on what makes a problem hard.
Question 5.
Design a new algorithm to solve a known NP-complete problem. Discuss the implications if your algorithm runs in polynomial time.
Show hintHide hint
Reflect on the importance of P vs NP.
Question 6.
Discuss the consequences for practical applications if intractable problems could suddenly be solved efficiently.
Show hintHide hint
Consider how industries rely on current computational limits.

6 more questions in this section. Enroll free to practise them all.