0% found this document useful (0 votes)
3 views

Assignment 1

The document is an assignment for the course 'Quantitative Reasoning-II' at the NUST Institute of Civil Engineering, focusing on logical reasoning and truth tables. It includes four questions that require the application of De Morgan's laws, truth tables, and logical equivalences. The assignment is due on February 27, 2025.

Uploaded by

weginam817
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
3 views

Assignment 1

The document is an assignment for the course 'Quantitative Reasoning-II' at the NUST Institute of Civil Engineering, focusing on logical reasoning and truth tables. It includes four questions that require the application of De Morgan's laws, truth tables, and logical equivalences. The assignment is due on February 27, 2025.

Uploaded by

weginam817
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

National University of Sciences and Technology

NUST Institute of Civil Engineering

Course Title: Quantitative Reasoning-II Course Code: Math-101


Instructor Name: Dr. Muhammad Israr Assignment-1
Class: UG CE-2024 Date of Submission: 27-02- 2025

Q1: Use De Morgans’s law to write the negations of the given statements. Also plot the final
solution graphically.

i. 𝑥 ≤ −1 𝑜𝑟 𝑥 > 1
ii. 1 > 𝑥 ≥ −3

Q2: Use truth tables to establish which of the given statement form is a tautology and which is a
contradiction.

i. (𝑝 ⋀ 𝑞) ⋁ (¬𝑝 ⋁ (𝑝 ⋀ ¬𝑞))
ii. ((¬𝑝 ⋀ 𝑞) ⋀(𝑞 ⋀ 𝑟)) ⋀ ¬𝑞

Q3: Use logical equivalences to prove the following.

i. ¬(𝑝 ⋁ ¬𝑞) ⋁ (¬𝑝 ⋁ ¬𝑞) ≡ ¬𝑝


ii. (𝑝⋀ (¬(¬𝑝 ⋁ 𝑞))) ⋁(𝑝 ⋀ 𝑞) ≡ 𝑝

Q4: If statement forms P and Q are logically equivalent, then 𝑷 ↔ 𝑸 is a tautology. Conversely,
if 𝑷 ↔ 𝑸 is a tautology, then P and Q are logically equivalent. Use ↔ to convert each of the
logical equivalences in given below to a tautology. Then use a truth table to verify each
tautology.

i. 𝑝 → (𝑞 ⋁ 𝑟) ≡ (𝑝 ⋀ ¬𝑞) → 𝑟
ii. 𝑝 ⋀ (𝑞 ⋁ 𝑟) ≡ (𝑝 ⋀ 𝑞) ⋁ (𝑝 ⋀ 𝑟)

You might also like