Practice Conversion To Cnf (3.9) - 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.
What does it mean for a proposition to be satisfiable?
Show hintHide hint
Think about truth assignments for variables.
Question 2.
Define a literal.
Show hintHide hint
What basic elements make up propositional logic?
3Question 3.
What is a satisfiable proposition?
- Always false for any assignment
- True for all assignments
- True for at least one assignment
Show hintHide hint
Consider the definition of satisfiability.
4Question 4.
In CNF, what is the form of a clause?
- A conjunction of literals
- A disjunction of literals
- A sequence of variables
Show hintHide hint
Focus on how CNF is structured.
Question 5.
Convert the expression (¬A ∧ (B ∨ C)) → D into CNF.
Show hintHide hint
Start with the logical identities.
Question 6.
Determine whether the expression (A ∨ B) ∧ (¬A ∨ C) is satisfiable. Explain your reasoning.
Show hintHide hint
Test various truth assignments!

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