Scribd
Upload
105 views2 pages

21MAB302T DM Unit 1 Tutorial Sheet

Uploaded by

vm4512
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
105 views2 pages

21MAB302T DM Unit 1 Tutorial Sheet

Uploaded by

vm4512
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

SRM Institute of Science and Technology

College of Engineering and Technology


Department of Mathematics

SRM Nagar, Kattankulathur – 603203, Chengalpattu District, Tamilnadu


Academic Year: 2024-2025 (ODD)
Course Code &Title: 21MAB302T-Discrete Mathematics Date: 27/07/2024

Year & Sem: III/V


Unit 1 – Tutorial Sheet

Part A Marks: 5 X 8
SI. Question Answers
No
1 Use the set builder notation to establish the identities
(𝐴 − 𝐶) ∩ (𝐶 − 𝐵) = ∅

2 If A and B are any two sets, prove analytically or using set


identities, 𝐴 ∩ (𝐵 − 𝐶) = (𝐴 ∩ 𝐵) − (𝐴 ∩ 𝐶).
Also show that 𝐴 ∪ (𝐵 − 𝐶) ≠ (𝐴 ∪ 𝐵) − (𝐴 ∪ 𝐶). Is the
principle of duality failed here? Explain.
3 State which of the following are injections, surjections or i. bijection
bijections from R into R, where R is the set of all real ii. neither injection nor
numbers surjection.
i. f(x) = -2x ii. g(x) = 𝑥 2 − 1
4 For the poset {3,5,9,15,24,45}, with divisibility relation
defined on it. Draw its directed graph and reduce it to Hasse
diagram.

5 Let R be a relation defined on the set of all real numbers, by


‘if x, y are real numbers, x R y ⟺ x – y is a rational
number’. Show that R is an equivalence relation.

Part B Marks: 3 ×15


SI. Question Answers Marks
No
A. Find the Dual of the following i. 𝐴 ∩ 𝐴′ = ∅
i. 𝐴 ∪ 𝐴′ = 𝑈 ii.(𝐴 ∩ 𝐵)′ = 𝐴′ ∪ 8
ii. (𝐴 ∪ 𝐵)′ = 𝐴′ ∩ 𝐵′ 𝐵′
1 iii.(𝐴 ∪ 𝐵 ′ )′ 𝐵 =
𝑖𝑖𝑖. (𝐴 ∩ 𝐵′)′ ∪ 𝐵 = 𝐴′ ∪ 𝐵
𝐴′ ∩ 𝐵
B. Let D be a set of all positive divisor of 30. A relation is
defined on D as “a R b iff a divides b”, for a, b in D. 7
Prove that R is a partial ordered relation. Hence draw the
Hasse diagram of the poset.

A. For the relation 𝑅 = {(1,2), (2,3), (3,3), (3,4), (4,2)} 0 1 1 1


defined on 𝑋 = {1,2,3,4}, find the transitive closure of (0 1 1 1) 8
0 1 1 1
𝑅 using Warshall’s algorithm. 0 1 1 1
2

B. Let𝑅 be the following equivalence relation on the set [1] = {1,5},


𝐴 = {1,2,3,4,5,6}, and 𝑅 = [2] = {2,3,6}, 7
{(1,1), (1,5), (2,2), (2,3), (2,6), (3,2), (3,3), [3] = {2,3,6},
(3,6), (4,4), (5,1), (5,5), (6,2), (6,3), (6,6)}. [4] = {4,4},
[5] = {1,5},
Find the equivalence classes of 𝑅. Hence find the
[6] = {2,3,6}.
partition of 𝐴 induced by 𝑅.
P(A)={{1,5},{2,3,6},
{4}}

A. If 𝑓, 𝑔: 𝑅 → 𝑅 where 𝑓(𝑥) = 𝑎𝑥 + 𝑏, 𝑔(𝑥) = 1– 𝑥 + 𝑎 = 3, 𝑏 = −1 8


𝑥 2 and (𝑔 ∘ 𝑓)(𝑥) = 9𝑥 2 – 9𝑥 + 3. Find the values of
3 𝑎 and 𝑏.
B. Let 𝑓: 𝑋 → 𝑌 and 𝑔: 𝑌 → 𝑍 be functions. We can
define the composition of 𝑓and 𝑔 to be the function
𝑔 ∘ 𝑓: 𝑋 → 𝑍 which the image of each 𝑥 ∈ 𝑋 is 7
𝑔(𝑓(𝑥)).
a) If 𝑓 and 𝑔 are both injective, must 𝑔 ∘ 𝑓 be injective?
Explain.
b) If 𝑓 and 𝑔 are both surjective, must 𝑔 ∘ 𝑓 be
surjective?

You might also like