Practice Conclusion (3.2.6) - SAT Problem - Discrete Mathematics

Practise this section

9 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
3 questions · about 2 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
Define the SAT problem.
Show hintHide hint
Think about the 'satisfiability' you learned about.
Question 2.
What is Conjunctive Normal Form?
Show hintHide hint
Consider how conjunctions and disjunctions interact.
3Question 3.
What is the main goal of the SAT problem?
- To find every possible truth assignment
- To determine if a logical formula has at least one satisfiable assignment
- To prove that a logical formula is always true
Show hintHide hint
Think about what 'satisfiable' means.
4Question 4.
True or False: A proposition is unsatisfiable if its negation is a tautology.
- True
- False
Show hintHide hint
Recall how contradictions relate to tautologies.
Question 5.
Given the expression ¬(p ∧ q) ∨ (r ∧ ¬s), transform it into CNF.
Show hintHide hint
Use logical identities and double-check each transformation for correctness.
Question 6.
Construct a logical formula that represents a Sudoku puzzle's row condition.
Show hintHide hint
Think about how to express uniqueness and presence.

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