Scribd
Upload
11 views2 pages

DMS Tutorial Sheet 4

The document outlines the course details for 'Discrete Mathematical Structures' offered by the School of Computer Science Engineering and Technology for the B.Tech program. It includes course objectives, a mapping of questions to course outcomes, and a series of logical problems and exercises related to propositional logic, predicate logic, and quantifiers. Additionally, it features quotes on the nature of logic by Ludwig Wittgenstein.

Uploaded by

Siva Sai
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
11 views2 pages

DMS Tutorial Sheet 4

The document outlines the course details for 'Discrete Mathematical Structures' offered by the School of Computer Science Engineering and Technology for the B.Tech program. It includes course objectives, a mapping of questions to course outcomes, and a series of logical problems and exercises related to propositional logic, predicate logic, and quantifiers. Additionally, it features quotes on the nature of logic by Ludwig Wittgenstein.

Uploaded by

Siva Sai
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

School of Computer Science Engineering and Technology

Course-B.Tech Type- Core


Course Code- CSET106 Course Name- Discrete Mathematical Structures

Year- 2025 Semester- Even


Date- 02/02/2025 Batch- 2024-2028

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

Objectives
1. Students will be able to check the validity of arguments and infer the valid conclusion.
2. Students will be able to learn the significance of Predicate and Quantifiers.
3. Students will be able to learn the conversion of English language in logical language and vice versa.

Questions:
1. Use inference rules of propositional logic to check the validity of the following arguments.
a) If I run, I will get there quicker. I got there quicker. Therefore, I must have ran.
b) If I run, I will get there quicker. I did not run. Therefore, I did not get there quicker.
c) If Bennett University is in Greater Noida, then Bennett University is in UP. Bennett University is
in UP Therefore, Bennett University is in Greater Noida.
d) Jatin is either a policeman or a footballer. If he is a policeman, then he has big feet. Jatin does not
have big feet, so he is a footballer.
e) If the company invests in renewable energy, it will reduce its carbon footprint. The company has
decided to invest in renewable energy. Either the company reduces its carbon footprint, or it faces
public backlash. Therefore, the company will not face public backlash.
f) If a student attend lectures of DMS, student’s understanding of computer science will improve.
Students’ understanding of computer science has not improved. If a student is not attending
lectures, either student is not present on campus or DMS examination is not tough. Continuous
evaluation policy confirms that the student is present on campus. Therefore, DMS examination is
not tough.

2. Write the symbolic form of the following sentences without using the notion of universe of
discourse (unrestricted domain).
a) All lawyers are liars.
b) Some lawyers are not liars.
c) Any person who becomes a politician will get corrupt.
d) No doctors know calculus.
e) For every positive integer, there is a positive integer greater than it.
f) Every integer is either positive or negative.
School of Computer Science Engineering and Technology

3. Write the symbolic form of the following sentences using appropriate Predicate and
Quantifier.
a) Every Indian festival is celebrated either based on solar or lunar calendars.
b) Every citizen is eligible to vote if and only if they are above 18 years of age.
c) In a family, every member either enjoys spicy food and dislikes sweets or likes sweets but
prefer spicy flavors.
d) Every even number greater than 2 can be expressed as the sum of two primes.

4. Translate each of the following predicate into an English statement.


a) ∃x: (s(x) ∧ ∀y:(s(y) → (x = y))), where s(x): x is a book on the table.
b) ∀x: prime(x)∧greater(x,2) → odd(x).
c) ∃x ∀y: x + y = y, provided the universe of discourse consists of all real numbers.

5. Consider the following predicates:


P (x, y): x > y
Q (x, y): x ≤ y
R(x): x − 7 = 2
S(x): x > 9
If the domain of discourse is the real numbers, give the truth value of each of the following
propositions:
a) ∃x: R(x)
b) ∀y: ¬ S(y)
c) ∀x ∃y: P (x, y)
d) ∃y ∀x: Q (x, y)
e) ∀x ∀y: (P (x, y) ∨ Q (x, y))
f) ∃x: S(x)∧ ¬ (∀x: R(x))
g) ∃y ∀x: S(y) ∧ Q (x, y)
h) ∀x ∀y: (R(x) ∧ S(y)) → Q (x, y)

6. Use predicate logic to check whether the following arguments are valid or not.
a) All foods that are healthy to eat do not taste good. Tofu is healthy to eat. You only eat what tastes
good. Therefore, you do not eat tofu.
b) Everyone from Bennett University lives within 50 km of the India Gate. Someone from Bennett
University has never seen the India Gate. Therefore, who lives within 50 km of the India Gate has
never seen the India Gate.
c) All protons are subatomic particles. All neutrons are subatomic particles. Hence, all protons are
neutrons.

Logic is not a theory but a reflection of the world. Logic takes care of itself. All we have to do is to
look and see how it does it.
-Ludwig Wittgenstein

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy