KEMBAR78
DMS Tutorial Sheet 2 | PDF
Scribd
Upload
49 views2 pages

DMS Tutorial Sheet 2

The document provides a tutorial sheet for a course on Discrete Mathematical Structures. It includes 8 questions covering topics like propositional logic, conditional statements, truth tables, and more. The document aims to help students apply propositional logic to areas like computer circuits, programming, and expert systems.

Uploaded by

sanskarsinghsengar
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
49 views2 pages

DMS Tutorial Sheet 2

The document provides a tutorial sheet for a course on Discrete Mathematical Structures. It includes 8 questions covering topics like propositional logic, conditional statements, truth tables, and more. The document aims to help students apply propositional logic to areas like computer circuits, programming, and expert systems.

Uploaded by

sanskarsinghsengar
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
You are on page 1/ 2

Course Name: Discrete Mathematical Structure Course Code: CSET106

Academic Year: 2023-24 Semester: Even


Date: January 17, 2024 Type: 3-1-0
Tutorial Sheet: 2
CO-mapping: All the questions are mapped to CO-1.
Objectives: Students will be able to apply propositional Logic to designing computer circuits, to construct
computer programs, to build expert systems etc.

1. Given that the value of 𝑝 → 𝑞 is true, determine the value of ¬𝑝⋁(𝑝 ↔ 𝑞)?
2. If there are 4 propositions (p, q, r, s), how many possible combinations of T/F values are there?
3. Write the converse, inverse and contrapositive of the conditional statement “if 2+2=4 then I am not the
Prime Minister of India.”
4. Let p be the proposition “Mathematics is easy” and let q be the proposition “five is greater then
four”. Write the following statements in the symbolic form:
(a) Mathematics is easy and five is greater then four.
(b) Mathematics is easy or five is greater then four.
(c) Either Mathematics is not easy or five is not greater then four.
(d) Mathematics is not easy and five is not greater then four.
(e) Either Mathematics is easy and five is not greater then four or Mathematics is not easy and
five is greater then four.
5. Write the negation of each of the following statements:
(a) 2+7<13
(b) No nice people are dangerous.
6. Let p be the statement “Ravi is rich” and let q be the statement “Ravi is happy”. Write in the
English proposition, which corresponds to each of the following:
(a) ¬𝑝⋀𝑞
(b) 𝑝⋁¬𝑞
(c) ¬𝑝⋀𝑞
(d) ¬𝑝⋁(𝑝⋀¬𝑞)
7. 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) (𝑝⋀(𝑞⋀𝑟))⋁¬((𝑝⋁𝑞)⋀(𝑟⋁𝑠))
8. 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)

“Dream is not that which you see while sleeping it is something that does not let you sleep.”
A.P.J. Abd ul Ka lam

You might also like