Practice Encoding Sudoku With Propositional Variables (3.2.2)

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 the SAT problem in your own words.
Show hintHide hint
Focus on what it means for a formula to be 'true'.
Question 2.
What does it mean for a proposition to be satisfiable?
Show hintHide hint
Think of it as finding at least 1 condition for truth.
3Question 3.
What does the SAT problem determine?
- Whether a given proposition can be true.
- Whether a proposition can never be true.
- Only the truth value of variables.
Show hintHide hint
Think about the essence of logical expressions.
4Question 4.
True or False: A tautology is sometimes false.
- True
- False
Show hintHide hint
Recall the definition of tautology.
Question 5.
Given a non-CNF formula, derive its CNF equivalent by step-wise application of logic laws.
Show hintHide hint
Divide and conquer the formula step by step.
Question 6.
Construct a logical expression to represent that no two adjacent cells in a Sudoku can hold the same number.
Show hintHide hint
Consider all pairs of adjacent cells when formulating your expressions.

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