Scribd
Upload
2 views2 pages

Assignment 1

Uploaded by

vedese7683
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

Assignment 1

Uploaded by

vedese7683
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

MAHARASHTRA STATE SKILLS UNIVERSITY

Pune Satellite Centre


School of Science Engineering and Technology Skills
Department of Engineering
Discrete Mathematics
Assignment 1
Last date to submit: 4/10/24
1. Check whether the following sentences can be considered as statements:
a. 1024 is the smallest four-digit number that is a perfect square
b. She is a mathematics major
c. 128 = 26
d. X = 26
2. Write the following statements in symbolic form using operators (~, ˄ , ˅ ) and indicate
letters to represent component statements
a. Stocks are increasing but interest rates are steady
b. Juan is a maths major but not a computer science
c. Rima is Healthy and Wealthy but not Wise
d. Rima is neither wealthy nor wise but she is healthy
e. Let p =”x>5”, q = “x = 5”, r = 10>x” write
i. x≥ 5, ii. 10 > x ≥ 5 iii. 10 > x > 5
3. let p be the statement “DATAENDFLAG is off”, q the statement “ERROR equals 0”, and r the
statement “SUM is less than 1000” Express the following sentences in symbolic notation
a. DATAENDFLAG is off. ERROR equals 0 and SUM is less than 1000.
b. DATAENDFLAG is off but ERROR is not equals 0
4. Determine whether the following statement forms are logically equivalent, use truth table
and include a sentence to justify your answer
a. p ˅ (p ˄ q) and p
b. (p ˄ c) and (p ˅ c)
c. (p ˅ q) ˅ (p ˄ r) and (p ˅ q) ˄ r
5. Use De-Morgan’s Laws to write negations for the following:
a. Sam is an Orange belt and Kate is a red belt
b. The connector is loose or the machine is unplugged
c. The train is late or my watch is fast
6. Check whether the following statements form a Tautology or Contradiction
a. (p ˄ q) ˅ (~ p ˅ (p ˄ ~q))
b. (p ˄ ~q) ˄ (~p ˅ q)
7. Verify a logical equivalences give reasons:
a. (p ˄ ~q) ˅ p ≡ p
b. P ˄ (~ q ˅ p) ≡ p
c. ~ ( p ˅ ~ q) ˅ (~ p ˄ ~q) ≡ ~ p

You might also like