Sanjivani College of Engineering Kopargaon

(An Autonomous Engineering Institute)

Department of Computer Engineering

S. Y. B. Tech. (2021 Pattern, Semester-I)
Subject : Discrete Mathematics (CO201) Subject Teacher : Dr. S. N Gunjal

Unit -I
Significance of Discrete Mathematics in Computer Engineering, Sets– Need of Sets,
Representation of Sets, Set Operations, Venn diagram, cardinality of set, principle of
inclusion and exclusion, Types of Sets –Countable and Uncountable Sets, Finite and
Infinite Sets, Countably Infinite and Uncountably Infinite Sets. Introduction to
bounded and unbounded sets and multiset, power set, Subset, Universal Set, Empty
Set, Power Set. Propositional Logic-logic, Propositional Equivalences, Application
of Propositional logic-translating English Sentences, Proof by Mathematical
Induction.
Q. Questions CO Bloom’s
No Mapping Taxonomy
Level

1. Show how bit-wise operations on bit strings can be used to CO1 4

calculate the combinations of A = {a, b, c, d, e}, B = {b, c, d, g, p,
t, v}, C = {c, e, i, o, u, x, y, z}, and D = {d, e, h, i, n, o, t, u, x, y}.
a) A ∪ B b) A ∩ B c) (A ∪ D) ∩ (B ∪ C) d) A ∪ B ∪ C ∪ D

2. Given A = {{a, b}, {c}, {d, e, f }}. CO1 4

(a) List the elements of A.
(b) Calculate n(A).
(c) Calculate the power set of A.

3. Let A and B are two sets. If A is subset of B, then prove that P(A) CO1 4
is subset of P(B), where P(A) and P(B) are power sets of A and B
sets.

4. Let A = {2, 3, 4, 5}. CO1 4

(a) Show that A is not a subset of B = {x ∈ N | x is even}.
(b) Show that A is a proper subset of C = {1, 2, 3, . . ., 8, 9}.
5. Let U = {1,2, …, 9} be the universal set, and let A = {1, 2, 3, 4, 5}, CO1 4
C = {5, 6, 7, 8, 9}, E = {2, 4, 6, 8}, B = {4, 5, 6, 7}, D = {1, 3, 5, 7,
9}, F = {1, 5, 9}.
Calculate: (a) A ∪ B and A ∩ B; (b) A ∪ C and A ∩ C; (c) D ∪ F
and D ∩ F

6. Suppose N = {1, 2, 3, …} is the universal set, and A = {n | n ≤ 6}, CO1 4

B = {n | 4 ≤ n ≤ 9}, C = {1, 3, 5, 7, 9}, D = {2, 3, 5, 7, 8}.
Calculate :
(a) A ⊕ B;
(b) B ⊕ C;
(c) A ∩ (B ⊕ D);
(d) (A ∩ B) ⊕ (A ∩ D).

7. Prove that set of odd number is the countable set. CO1 4

8. Prove that the set of rational numbers is countably infinite. CO1 4

9. Each student in Liberal Arts at some college has a mathematics CO1 4

requirement A and a science requirement B. A poll of 140
sophomore students shows that: 60 completed A, 45 completed B,
20 completed both A and B.
Use a Venn diagram to calculate the number of students who have
completed:
(a) At least one of A and B; (b) exactly one of A or B; (c) neither A
nor B.

10. A survey on a sample of 25 new cars being sold at a local auto CO1 4
dealer was conducted to see which of three popular options, air-
conditioning (A), radio (R), and power windows (W), were already
installed. The survey found: 15 had air-conditioning (A), 5 had A
and P, 12 had radio (R), 9 had A and R, 3 had all three options. 11
had power windows (W), 4 had R and W,
calculate the number of cars that had: (a) only W; (b) only A; (c)
only R; (d) R and W but not A; (e) A and R but not W; (f) only one
of the options; (g) at least one option; (h) none of the options.
11. Suppose a list A contains the 30 students in a mathematics class, CO1 4
and a list B contains the 35 students in an English class, and
suppose there are 20 names on both lists. Calculate the number of
students: (a) only on list A, (b) only on list B, (c) on list A or B (or
both), (d) on exactly one list.

12. 100 sportsmen were asked whether they play cricket, football CO1 4
or hockey. Out of these 45 play cricket, 21 play football, 38
play hockey, 18 play cricket and hockey, 9 play cricket and
football, 4 play football and hockey and 23 play none of these.
Calculate the number of sportsmen who play :
(i) exactly one of the games
(ii) exactly two of the games.

13. Among the Integers 1 to 1000. Calculate CO1 4

How many of them are not divisible by 3 nor by 5 nor 7.
How many are not divisible by 5 and 7 but divisible by 3.

14. Prove by Mathematical induction, that CO1 4

15. Using induction principles prove that 𝑛3 + 2𝑛 is divisible by 3. CO1 4

16. Prove by Mathematical Induction that CO1 4

Let P be the proposition that the sum of the first n odd numbers is
n 2 that is, P (n) : 1 + 3 + 5 +···+ (2n − 1) = n2

17. Prove the following proposition (for n ≥ 0): CO1 4

P (n): 1 + 2 + 22 + 23 +···+ 2n = 2n+1 − 1

18. By using mathematical induction prove that : CO1 4

1 + 2 + 3 + ........ + n = n(n + 1)/2 for all natural number
values of n.

19. Using the truth table, prove that the proposition 𝑝 ∨ ¬(𝑝 ∧ 𝑞) is a CO1 4
 tautology.

20. Prove that (𝑝 → (𝑞 → 𝑟)) → ((𝑝 → 𝑞) → (𝑝 → 𝑟)) is a tautology CO1 4

21. Prove that ( 𝑝 → 𝑟) ∧ (𝑞 → 𝑟)𝑎𝑛𝑑 ( 𝑝 ∨ 𝑞) → 𝑟 are logically CO1 4

equivalent

22. Let p, q and r be the propositions CO1 4

P: You have attended cultural audition.
q: You miss the first minor exam.
r: You will not get the make-up exam.
Explore each of these propositions as an English sentence
i) (p→~ r) ∨(q→~ r)
ii) (p∧q) ∨ (~q∧ r)
iii) ~q↔r

23. What are the contrapositive, the converse, and the inverse of the CO1 4
conditional statement “The home team wins whenever it is
raining?”

24. Use : CO1 4

p : I will study discrete structure
q : I will go to a movie
r : I am in a good mood.
Explore the English sentence that corresponds to each of the
following :

25. What is Multi-set? Let P and Q are the two Multi-set defined as CO1 4
P={ a, a, a, c, d, d} and Q={a, a, b, c, c }. calculate the union,
Intersection, and difference of two multisets P and Q.
 Unit-II
Relations and Their Properties, n-ary Relations and Their Applications, Representing
Relations, Closures of Relations, Equivalence Relations, Partial Orderings,
partitions, Hasse Diagram, Lattices, Chains and Anti-Chains, Transitive Closure and
Warshall‘s Algorithm, n-Ary Relations and their Applications.
Functions- Surjective, Injective and Bijective functions, Inverse Functions and
Compositions of Functions, The Pigeonhole Principle.
1. Given A = {1, 2, 3, 4} and B = {x, y, z}. Let R be the following CO2 3
relation from A to B: R = {(1, y), (1, z), (3, y), (4, x), (4, z)}
(a) Determine the matrix of the relation.
(b) Draw the arrow diagram of R.
(c) Determine the inverse relation R −1 of R.
(d) Determine the domain and range of R.

2. Let A = {1, 2, 3}, B = {a, b, c}, and C = {x, y,z}. Consider the CO2 3
following relations R and S from A to B and from B to C,
respectively. R = {(1, b), (2, a), (2, c)} and S = {(a, y), (b, x), (c, y),
(c, z)}
(a) Find the composition relation R◦S.
(b) Find the matrices MR, MS, and MR◦S of the respective relations
R, S, and R◦S.

3. Show that the relation R is “Less than” from A to B CO2 3

where :
A = {1, 2, 8} and
B = {1, 2, 3, 5}
Find :
(i ) R in Roster form
(ii ) Domain and Range of R.

4. Let R and S be the following relations on A = {1, 2, 3}: CO2 3

R = {(1, 1), (1, 2), (2, 3), (3, 1), (3, 3)}, S = {(1, 2), (1, 3), (2, 1),
(3, 3)}
Find: (a) R ∪ S, R ∩ S, RC;
(b) R◦S;
(c) S2 = S◦S.
5. Let R = {(1, 4), (2, 1), (2, 5), (2, 4), (4, 3), (5, 3), (3, 2)} CO2 3
on the set A = {1, 2, 3, 4, 5}. Use Warshall’s algorithm to
find transitive closure of R

6. A = {1, 2, 3, 4}, B = {1, 4, 6, 8, 9}; aRb iff b = a2. Find CO2 3

the domain, range of R. Also find its relation matrix and draw
its diagraph.

7. Define the closure of Relation. Discuss about the following CO2 1

closure properties with examples :
(i) Reflexive closure
(ii) Symmetric closure
(iii) Transitive closure.

8. Let X= {1,2,3,4,5,} and relation R={(x,y)|x>y}.Draw the graph of CO2 3

‘R’ and also Determine its matrix.

9. Determine the transitive closure of given diagraph using Warshall’s CO2 3

algorithm

10. Let R be the following equivalence relation on the set A = {1, 2, 3, CO2 3
4, 5, 6}:
R = {(1, 1), (1, 5), (2, 2), (2, 3), (2, 6), (3, 2), (3, 3), (3, 6), (4, 4),
(5, 1), (5, 5), (6, 2), (6, 3), (6, 6)}
Determine the partition of A induced by R, i.e., find the
equivalence classes of R.

11. If R={(1,2),(2,1),(2,3),(3,4),(4,1))} be a relation on the CO2 3

set A={1,2,3,4}. Determine is relation reflexive, symmetric and
transitive?

12. If R={(a,b),(b,a),(b,c),(c,d),(d,a)} be a relation on the set CO2 3

A={a,b,c,d} Determine transitive closure of R given relation?
13. Let A={1,2,3,4} Consider partition CO2 3
p={{1,2,3},{4}} of A .
Determine the equivalence relation R on A determined by P.

14. Let A={1,2,3} R is the relation on A whose matrix is : CO2 3

Examine that R is Transitive Closure.

15. Determine the Transitive closure using Warshall Algorithm: CO2 3

16. Let A=Z+ is the set of positive integers, and let CO2 3

Determine Is the relation R Symmetric, Asymmetric or

AntiSymmetric.

17. Determine the transitive Closure of R by using Warshall algorithm CO2 3

Where A={1,2,3,4,5,6}
and R= {(x, y}| |x-y| =2}

18. Consider the relation R = {(a, a), (a, b), (b, c), (c, c)} on the set A = CO2 3
{a, b, c}. Determine : (a) reflexive Closure; (b) symmetric Closure;
(c) transitive Closure.

19. Let R be the relation on the set CO2 3

A={5, 6, 8, 10, 28, 36, 48}
Let R ={(a,b) | a is divisor of b} .Draw the Hasse diagram .
Determine wheater R is an equivalence relation.

20. The following is the Hasse diagram of the Poset CO2 3

{(a, b, c, d, e),<}
Examine It is a Lattices ? Justify.
21. Let A = {1, 2, 3} and f1 and f2 are functions from A to CO2 3
B given by :
f1 = {(1, 2), (2,3), (3,1)} and
f2 = {(1, 2), (2,1), (3,3)}
Compute f1 o f2 and f2 o f1

22. What are relations and functions? Given a relation, determine CO2 3
whether the following relations are function or not with justification
i) R1={(1,4),(2,4),(3,4),(4,4),(5,4)} ii) R2={(1,2),(2,4),(2,10),(3,8),
(4,6),(5,4)} iii) R3={(1,6),(2,2),(4,4),(5,10)}

23. What are relations and functions. Given a Relation R = CO2 3

{(1, 4), (2, 2), (3, 10), (4, 8)] (5, 6)} and determine whether the
following relations R1, R2, R3 & R4 is a function or not.
R1 = {(1, 4), (2, 4), (3, 4), (4, 4), (5, 4)}
R2 = {(1, 2), (2, 4), (2, 10), (3, 8), (4, 6), (5, 4)}
R3 = {(1, 6), (2, 2), (4, 4), (5, 10)}
R4 = {(1, 6), (2, 2), (3, 2), (4, 4), (5, 10)}

24. Let f(x)=x+2, g(x) = x-2, h(x) =3x CO2 3

Determine i) fog ii) fogoh.
25. Show that if 9 colors are used to paint 100 houses, then at least 12 CO2 3
houses having same color using pigeonhole principle.

Subject Teacher Head of Department

(Dr. S.N Gunjal) (Dr. D. B Kshirsagar)