MIT ADT University, Pune
MIT Art Design and Technology University’s
MIT School of Computing, Pune
Department of Applied Science & Humanities
First Year B. Tech. (All Branches)
23ASH1001: Mathematical Foundation for Computing –I
Tutorial No.:3
Batch: 1
1 0 0
1 Let 𝐴 = {𝑎, 𝑏, 𝑐} and let 𝑀𝑅 = [0 1 1] . Determine whether R is an equivalence relation.
0 1 1
Let A={1, 2, 3, 4, 5} and a relation defined by R={(1, 1), (1, 4), (1,5), (2, 2), (2,3), (3, 2), (3,3),
2 (4, 1), (4, 4), (4,5) (5, 1), (5, 4), (5, 5)}. Show that R is an equivalence relation and find its
equivalence classes.
If A={1,2,3,4} , R={(1,2), (2,1), (2,3), (3,4), (4,1)} Using Warshall’s Algorithm Find the
3
transitive closure of R
Let A = {1, 2, 3,4,6,9,12} Let aRb if a divided b. Show that R is POSET and draw a Hasse
4
diagram.
Functions, f, g & h are defined on the set X = {1,2,3} as, f = {(1, 3), (2, 1), (3, 2,)},
g = {(1, 2), (2, 3), (3, 1)}, h = {(1, 2), (2, 1), (3, 3)}.
5
i) Find fog and gof. Are they equals?
ii) Find fogoh and fohog.
Let 𝑓: 𝑅 → 𝑅 be a function where R is set of real numbers such that 𝑓(𝑥) = 𝑥 2 , where R is set
6 of real number. Then verify that the function 𝑓(𝑥)is bijection or not.
Batch: 2
Let A={1, 2, 3, 4, 5} and a relation defined by R={(1, 1), (1, 3),(1, 5),(2, 2),(3, 1),(3, 3), (3, 5),
1 (4, 4), (5, 1), (5, 3), (5, 5)}. Show that R is an equivalence relation and find its equivalence
classes.
Define equivalence relation. Identify whether the given relation is an equivalent relation where
2 A = {1, 2, 3, 4}, R = {(1, 1), (1, 2), (2, 1), (2, 2), (2, 3) (3, 1), (3, 2), (3, 3), (1, 3), (4, 4,)}. Also
find the equivalence Classes.
Let R= {(a, d), (b, a), (b, d), (c, b), (c, d), (d, c)}. Use Warshall’s algorithm to find the transitive
3
closure where A = {a, b, c, d}.
Let A={1, 2, 3, 6, 12, 24, 36, 48} and R is relation defined by “ a related to b” if a divides b
4
then show that R is POSET and draw its Hasse diagram.
MIT ADT University, Pune
5 Let 𝑓(𝑥) = 𝑥 + 2, 𝑔(𝑥) = 𝑥 − 2, ℎ(𝑥) = 3𝑥. Find gof, fog, fof, hog, gog, foh, hof, fohog.
Let 𝑓(𝑥) = 𝑥 2 be the function, then show that 𝑓 is
6 i) Injective if 𝑓: 𝑁 → 𝑁, where N is set of Natural numbers.
ii) Not injective if 𝑓: 𝑅 → 𝑁, where R is set of Real numbers and N is set of Natural numbers.
Batch: 3
Let R be the relation on the set of real numbers such that aRb if and only if a − b is an integer.
1
Is R an equivalence relation?
Let A={1, 2, 3, 4, 5} and a relation defined by R={(1, 1), (1, 2), (2,1), (2, 2), (3, 3), (3, 5) (4, 4),
2
(5, 3), (5, 5)}. Show that R is an equivalence relation and also find the partition of set A.
If A={1,2,3,4} , R={ (2,1), (2,3), (3,1), (3,4),(4,1),(4,3)} Using Warshall’s Algorithm Find the
3
transitive closure of R.
If A={1,2,3,4}, R={(1,1), (1,2), (2,2), (2,4), (1,3), (3,3), (3,4), (1,4), (4,4)} then show that R is
4
a Partial order and draw its Hasse diagram.
Let A = {a, b, c, d} and B = {1, 2, 3}. Determine whether the Relation R from A to B is a
function, Justify. If it is a function, give the range.
5
i) R = {(a, 1), (b, 2), (c, 1), (d, 2)}.
ii) R = {(a, 1), (b, 2), (a, 2), (c, 1), (d, 2)}.
i) Let 𝑓: 𝑁 → 𝑁, where N is set of Natural numbers such that 𝑓(𝑥) = 𝑥 2 . Then show that 𝑓is
not onto function
6
ii) Let 𝑓: 𝑍 + → 𝑍 + ,where 𝑍 + is the set of positive integers such that 𝑓(𝑥) = 2𝑥 + 1. Then show
that 𝑓is one to one function.