0% found this document useful (0 votes)
4 views2 pages

DMS Tutorial Sheet 3

Uploaded by

bkd2121212121
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
0% found this document useful (0 votes)
4 views2 pages

DMS Tutorial Sheet 3

Uploaded by

bkd2121212121
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

[Link] Type- Core


Course Code- CSET106 Course Name- Discrete Mathematical Structures

Year- 2025 Semester- Even


Date- 27/01/2025 Batch- 2024-2028

CO-Mapping
Q1 Q2 Q3 Q4 Q5 Q6
CO1      
CO2
CO3

Objectives
1. Students will be able to learn logical operators.
2. Students will be able to learn the equivalence of propositions.
3. Students will be able to learn the conversion of English language in logical language.

Questions:

1. 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.

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


Note: Do not use truth table.

(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)

3. Show that each of these statements is a tautology.

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


(b) (p ∧ q) → (p → q)
(c) ((p → q) ∧ (q → r)) → (p → r)

4. Given the expression p ∧ q∨ r, determine the order of evaluation based on the precedence
of logical operators.
School of Computer Science Engineering and Technology

5. Define tautology, contradiction, and contingency with example.

6. 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

You might also like