Scribd
Upload
2 views2 pages

Tutorial 02

This document outlines a tutorial for the B.Tech course in Discrete Mathematical Structures, focusing on truth values of compound propositions, truth tables, and logical equivalences. It includes exercises for calculating truth values, constructing truth tables, evaluating logical statements in programming, applying De Morgan's laws, and establishing logical equivalences. The tutorial aims to enhance understanding of logical concepts and their applications.

Uploaded by

p7zzcd5hbr
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views2 pages

Tutorial 02

This document outlines a tutorial for the B.Tech course in Discrete Mathematical Structures, focusing on truth values of compound propositions, truth tables, and logical equivalences. It includes exercises for calculating truth values, constructing truth tables, evaluating logical statements in programming, applying De Morgan's laws, and establishing logical equivalences. The tutorial aims to enhance understanding of logical concepts and their applications.

Uploaded by

p7zzcd5hbr
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

School of Computer Science Engineering and Technology

Course- [Link]. Type- Core


Course Code- 2025CSET106 Course Name- Discrete Mathematical Structures
Year- I Semester- Even (2nd Semester)

Tutorial-2

Tutorial Name CO1 CO CO3


No. 2
2 Truth values of compound  -- 
propositions using truth table
and without truth table, and
logical equivalences

Objective: The main objective of this tutorial is to learn about propositions, truth values of
compound propositions using truth table and without truth table, and logical equivalences.

1. Given the truth values of p and q as true and those of r and s as false, find the truth values of
the following:
(a) 𝑝⋁(𝑞⋀𝑟)
(b) (𝑝⋀(𝑞⋀𝑟))⋁¬((𝑝⋁𝑞)⋀(𝑟⋁𝑠))

2. Construct the truth table for the following:


(a) [𝑝⋀(𝑝 → 𝑞)] → 𝑞
(b) [(p→q)⋀(q→r)]→(p→r)
(c) (p → q) ∧ (¬p → r)
(d) (p ↔ q) ∨ (¬q ↔ r)
(e)(¬p ↔ ¬q) ↔ (q ↔ r)
3. What is the value of x after each of these statements is encountered in a computer program, if x
= 1 before the statement is reached?
(a) if x + 2 = 3 then x := x + 1
(b) if (x + 1 = 3) OR (2x + 2 = 3) then x := x + 1
(c) if (2x + 3 = 5) AND (3x + 4 = 7) then x := x + 1
(d) if (x + 1 = 2) XOR (x + 2 = 3) then x := x + 1
(e) if x < 2 then x := x + 1
4. Use De Morgan’s laws to find the negation of each of the following statements.
(a) Amar is rich and happy.
(b) Virat is smart and hard working.
(c) Leela will move to Bangalore or Delhi.

5. Establish the following logical equivalences by developing a sequence of logical equivalences.


Note: Do not use truth table.
School of Computer Science Engineering and Technology

(a) ¬(p ∨ (¬p ∧ q)) ≡ ¬p ∧ ¬q


(b) (p → q) ∧ (p → r) ≡ p → (q ∧ r)
(c) (p → r) ∧ (q → r) ≡ (p ∨ q) → r
(d) (p → q) ∨ (p → r) ≡ p → (q ∨ r)
(e) (p → r) ∨ (q → r) ≡ (p ∧ q) → r
(f) ¬p → (q → r) ≡ q → (p ∨ r)
(g) p ↔ q ≡ ¬p ↔ ¬q
(h) p ↔ q ≡ (p ∧ q) ∨ (¬p ∧ ¬q)

“Dream is not that which you see while sleeping it is something that does not let you sleep.”
A. P . J. A b du l K a la m

You might also like