Practice Unsatisfiable Proposition (3.3) - 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 a satisfiable proposition.
Show hintHide hint
Think about what it means for something to be true.
Question 2.
Give an example of a tautological statement.
Show hintHide hint
Consider statements that cover all possibilities.
3Question 3.
What is a satisfiable proposition?
- A proposition that is always false
- A proposition that is true at least once
- A tautology
Show hintHide hint
Think about what it means for an expression to be true in logic.
4Question 4.
Is 'p and not p' satisfiable?
- True
- False
Show hintHide hint
Consider the logic of contradiction.
Question 5.
Prove whether the proposition 'A or (B and not B)' is satisfiable or unsatisfiable.
Show hintHide hint
Look for truth assignments for each variable.
Question 6.
Convert the equivalent of '(p and q) implies r' to CNF.
Show hintHide hint
Apply implications and understand distribution rules.

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