Practice Intractability: Checking Algorithms (12) - Intractability: Checking Algorithms

Practise this section

10 questions

Flashcard drill
4 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.
What is intractability?
Show hintHide hint
Think about problems that are difficult to solve.
Question 2.
Define a checking algorithm.
Show hintHide hint
How is it different from generating algorithms?
3Question 3.
What does intractability refer to?
- Easy problems
- Difficult problems with unknown efficient solutions
- Problems that can always be solved
Show hintHide hint
Think about problems that are challenging to solve.
4Question 4.
True or False: Checking algorithms generate solutions.
- True
- False
Show hintHide hint
Recall what checking algorithms do.
Question 5.
Consider a Boolean formula in conjunctive normal form (CNF) with three variables. Propose a method to check satisfiability.
Show hintHide hint
Think about how to evaluate each clause.
Question 6.
Propose an alternative approach to the Traveling Salesman Problem using checking algorithms.
Show hintHide hint
What bounds can you set to refine your search?

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