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

Assignment-1- DSTL

Uploaded by

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

Assignment-1- DSTL

Uploaded by

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

Inderprastha Engineering College, Ghaziabad

Department of Computer Science and Engineering


Session 2024-25

ASSIGNMENT No 1
Course B. Tech (CSE)
Subject Name & Code Discrete structure and theory of logic (BCS 303)
SEM & Section III Sem& A/B
Date Given 04/10/2024
Date Submission 11/10/2024
Faculty Name Dr. Deepti Singh

Q1: Justify that the power set P(A) of a set A with n elements has 2 n elements.

Q2: Let A, B, C be three nonempty sets. Justify the following:


1. A - (B ∩ C) = (A - B) ∪ (A - C)
2. A × (B ∪ C) = (A × B) ∪ (A × C)
3. A × (B ∩ C) = (A × B) ∩ (A × C)

Q3: How many reflexive and symmetric relations are there on a set A with n elements?

Q4: Find which of the following relations on the set A = {1, 2, 3, 4} are reflexive, symmetric,
transitive, or antisymmetric:
(a) R1 = (1, 1), (1, 2), (2, 1), (2, 3), (3, 3), (4, 1), (5, 2);
(b) R2 = (1, 1), (1, 2), (1, 4), (2, 1), (2, 2), (3, 3), (4, 1), (4, 4);
(c) R3 = (2, 1), (3, 1), (3, 2), (4, 1), (4, 2), (4, 3).

Q5: Justify that the relation ∼ defined on the set of integers Z as


a∼b ⟺ 6 divides (b−a),
is an equivalence relation. Also, list all elements of the set Z 6 of integers modulo 6.

Q6: Let ∼ be an equivalence relation on a set A. Show that


A = [a1] ∪ [a2] ∪⋯∪ [an] ∪⋯
where a i not equal to a j if i not equal to j. What do you call the sets on the right side?

Q 7: Let P consist of the eight sets S0,S1,S2,S3,S4,S5,S6,S7 given by


S0={a,b,c,d,e,f}, S1={a,b,c,d,e}, S2={a,b,c,e,f}, S3={a,b,c,e}, S4={a,b,c}, S5={a,b}, S6={a,c},
S7={a}. Draw the Hasse diagram of the Poset (P,⊆).

Q8: The partial order ≤ for each one of the following posets is the relation "divides".
(i) Draw the Hasse diagram of the posets P1,≤ and P2, ≤ where
P1={1,2,3,4,6,7,8,9,12,18,24}
P2={3,4,12,24,48,72}.
(ii) Find the maximal and minimal elements of the poset P,≤ where
(iii) Let P={1,2,3,4,5, 6,7,8},A={1,2} and B={3,4,5}. Find the lower and upper bounds of the
subsets A and B of the Poset . Also, find the inf(A),sup(B), and inf(B).
Q9: Give a suitable example of a Poset (P,≤) in each of the following cases:
(i) P has minimal elements, but no maximal element.
(ii) P neither has a minimal element nor a maximal element.
(iii) P contains a set A with more than one upper bounds, but sup(A) doesn’t exist.
(iv) P contains a set A with more than one lower bounds, but inf(A) doesn’t exist.

Q10: Define a lattice. State the principle of duality for lattices.

Q11: Justify that the set D 36 is a lattice with respect to the relation “divides”.

Q 13. Let L be a lattice, and a,b,c,d ∈ L such that a≤b and c≤d . justify that

a ∨ c ≤ b ∨ d and a ∧ c ≤ b ∧ d.
Q14:Justify that the following distributive inequality holds in every lattice L:
a ∧ b ∨ c ≥ a ∧ b ∨ a ∧ c , for all a, b, c belongs to L.
What about a lattice wherein the equality holds?

Q15: Define bounded, complemented, modular, and complete lattices.


(i) Justify that every distributive lattice is modular. Show that the converse is not true.
(ii) Give an example of a finite lattice L such that at least one element of L has no complement.
(iii) Give an example of a finite lattice L such that at least one element of L has more than one
complement.
(iv) Find the complements of elements of the lattice D42.

Q16: Define complete lattice. Is every finite lattice a complete lattice? If yes, give an example of
an infinite complete lattice.

You might also like