Practice Introduction To Satisfiability Problem (3.1) - SAT Problem - Discrete Mathematics

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.
Define a satisfiable proposition.
Show hintHide hint
Think about truth assignments possible.
Question 2.
What does it mean for a proposition to be unsatisfiable?
Show hintHide hint
Remember the tautology's role.
3Question 3.
What is a satisfiable proposition?
- It is always false
- It can be true for some assignments
- It cannot be true for any assignments
Show hintHide hint
Think about when a proposition can be true.
4Question 4.
True or False: Every unsatisfiable proposition has a negation that is a tautology.
- True
- False
Show hintHide hint
Consider definitions of unsatisfiability.
Question 5.
Given the proposition (p → q) ∧ (¬q ∨ r), convert it into conjunctive normal form.
Show hintHide hint
Remember rules for negations and implications.
Question 6.
Explain how a Sudoku puzzle can be encoded as a SAT problem and the implication of each rule.
Show hintHide hint
Think of how you’ll frame each number’s placement in SAT terms.

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