0% found this document useful (0 votes)
11 views1 page

Discrete Mathematics Assignment 1

The assignment consists of various problems related to discrete mathematics, including verifying logical equivalences using truth tables, drawing Hasse diagrams for posets, obtaining DNF and CNF forms, and proving properties of relations and operations defined on sets. Specific tasks include demonstrating that certain relations are equivalence relations and showing that a given relation is a partial order. Each question requires a combination of theoretical proof and practical application of discrete mathematics concepts.

Uploaded by

mfurqankhattak
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)
11 views1 page

Discrete Mathematics Assignment 1

The assignment consists of various problems related to discrete mathematics, including verifying logical equivalences using truth tables, drawing Hasse diagrams for posets, obtaining DNF and CNF forms, and proving properties of relations and operations defined on sets. Specific tasks include demonstrating that certain relations are equivalence relations and showing that a given relation is a partial order. Each question requires a combination of theoretical proof and practical application of discrete mathematics concepts.

Uploaded by

mfurqankhattak
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

QUAID-i-AZAM UNIVERSITY

Discrete Mathematics
Assignment No. 1

Q.1 Verify the logical equivalence by using laws and justify your answer
using truth table.
a)
r ∨ p ∧  r ∨ p ∧ q ∧ r ∨ q and p ∧ q
b)
  p ∧ q ∧ p ∨ q ≡ p

Q.2 Draw the Hasse Diagram for the following poset


a)
P0, 1, 2, 3, ⊆
b)
3, 4, 12, 24, 48, 72, /

Q.3 Obtain the DNF and CNF of


q ∨ p ∧ r ∧ p ∨ q ∧ q

Q.4 Let S  Z  Z − 0. Define the relation " " on S where a, b  c, d
if and only if ad  bc.
a) Prove that  is an equivalence relation.
b) Define the operation a, b ⊕ c, d  ad  bc, bd. Prove that ⊕
is well-defined on the set of equivalence classes.

Q.5 Show that the relation R  a, b ∣ a divides b defined on the set
S  1, 2, 3, 4, 6 is a partial order relation.

You might also like