Practice Algorithm For Tautology Check (7.3.3) - Tutorial 1: Part II - Discrete Mathematics

Practise this section

8 questions

Flashcard drill
2 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.
What defines a tautology?
Show hintHide hint
Think about examples like 'p OR NOT p'.
Question 2.
What does the negation of a proposition do?
Show hintHide hint
If the original is true, what is its negation?
3Question 3.
Is 'p OR NOT p' a tautology?
- True
- False
Show hintHide hint
Evaluate the truth values.
4Question 4.
What happens if the negation of a proposition is satisfiable?
- The proposition is a tautology
- The proposition is not a tautology
- Indeterminate
Show hintHide hint
Think about what satisfiability means.
Question 5.
Prove that the compound proposition 'not(p AND q)' is equivalent to 'NOT p OR NOT q'.
Show hintHide hint
Start from the negation and manipulate it with laws.
Question 6.
Identify a real-world scenario where tautologies are critical.
Show hintHide hint
Think in terms of technology and reliability.

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