Enrol to start learning
Reading is open to everyone. Enrolling is free, and it is what unlocks the audio lessons, practice tests and progress tracking.
12. Intractability: Checking Algorithms
This section
Practice test
12 questions on this section. Wrong answers show you what to read again.
Sign up to take itWhole chapter
Revision test
Mixed questions from across the chapter. Your answers get marked.
Sign up to take itQuick
Flashcard drill
4 cards from this lesson. Good the night before a test.
Try these first
- 1.
What is intractability?
Hint
Think about problems that are difficult to solve.
- 2.
Define a checking algorithm.
Hint
How is it different from generating algorithms?
- 3.
What does intractability refer to?
- Easy problems
- Difficult problems with unknown efficient solutions
- Problems that can always be solved
Hint
Think about problems that are challenging to solve.
- 4.
True or False: Checking algorithms generate solutions.
- True
- False
Hint
Recall what checking algorithms do.
- 5.
Consider a Boolean formula in conjunctive normal form (CNF) with three variables. Propose a method to check satisfiability.
Hint
Think about how to evaluate each clause.
- 6.
Propose an alternative approach to the Traveling Salesman Problem using checking algorithms.
Hint
What bounds can you set to refine your search?
Exercises
Total Questions
2
Estimated Time
4 min
Passing Score
70%
Instructions
- Read each question carefully
- You can use hints if you need help
- Complete all questions before submitting
4 more questions available
Enrol freeQuiz
Total Questions
2
Estimated Time
4 min
Passing Score
70%
Instructions
- Read each question carefully
- You can use hints if you need help
- Complete all questions before submitting
2 more questions available
Enrol freeChallenge Problems
Total Questions
2
Estimated Time
4 min
Passing Score
70%
Instructions
- Read each question carefully
- You can use hints if you need help
- Complete all questions before submitting