Practice Sat Problem (3) - SAT Problem - Discrete Mathematics

Practise this section

8 questions

Flashcard drill
5 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
2 questions · about 1 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 a scenario where it is at least true.
Question 2.
What does it mean for a proposition to be unsatisfiable?
Show hintHide hint
What if there are no conditions making it true?
3Question 3.
What is a satisfiable proposition?
- A proposition that is always false
- A proposition that is true for at least one assignment
- A proposition that is a contradiction
Show hintHide hint
Consider cases where it can be true.
4Question 4.
True or False: An unsatisfiable proposition can be true for some assignments.
- True
- False
Show hintHide hint
Recall the definition of unsatisfiability.
Question 5.
Create an expression for the compound proposition to show that either A is true or B is true, but not both.
Show hintHide hint
Think about how to combine the two propositions safely.
Question 6.
Given the expression (p ∧ q) ∨ (¬p ∧ r), express it in CNF.
Show hintHide hint
Use logical identities to help in reformatting.

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