Practice Question 9 (7.3) - Tutorial 1: Part II - 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.
Provide a simple compound proposition in CNF and explain if it is satisfiable.
Show hintHide hint
Check if you can find a truth assignment.
Question 2.
What does it mean for a proposition to be unsatisfiable?
Show hintHide hint
Consider logical contradictions.
3Question 3.
What is satisfiability in propositional logic?
- A property that makes a statement always true.
- The ability to find at least one truth assignment that makes the formula true.
- The counting of propositions in a formula.
Show hintHide hint
Think about the meaning of truth assignments.
4Question 4.
True or False: A tautology is always satisfiable.
- True
- False
Show hintHide hint
Consider the definition of tautology.
Question 5.
Given the expression (p OR ¬q) AND (¬p OR r), determine all possible truth assignments and their impact on satisfiability.
Show hintHide hint
Create a detailed truth table mapping variables.
Question 6.
Construct a CNF expression that is unsatisfiable and explain why it cannot be satisfied.
Show hintHide hint
Think of contradictions in logical statements.

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