Total No. of Questions : 4] SEAT No.

:
PA-20 [Total No. of Pages : 2
[5931]-30

3
6:0
S.E. (Computer Engineering and AI & DS and Computer

:3
Science & Design Engineering)

10
/01 71
DISCRETE MATHEMATICS

23
8
(2019 Pattern) (Semester - I) (210241)

/20
.38 13
Time : 1 Hour]
0 [Max. Marks : 30
16
7.1 GP

Instructions to the candidates:

1) Answer Q1 or Q2, Q3 or Q4.
CE
84

2) Figures to the right indicate full marks.

3) Neat diagrams must be drawn wherever necessary.
6

3
4) Assume suitable data, if necessary.
3.1

6:0
10

:3
Q1) a) Let U = {1, 2, 3, ........., 10}, A = {2, 4, 6, 8, 10}, B = {1, 3, 5, 7, 9, 10}[6]

10
Find: 1/2 1
3
7
02
8 1 38

i) (A  B)'
4.3 01
6/0

ii) (A  B)'
GP

iii) (B)'
CE

iv) (B–A)'
8
7.1

b) Let p be “Mark is Rich” and q be “Mark is happy” write each of following

6

:03
3.1

in symbolic form [4] 6

10

0:3

i) Mark is poor but happy

31
1/2 1

ii) Mark is neither rich nor happy

7
02
38

iii) Mark is either rich or happy

01
6/0

iv) Mark is Rich and not happy

7.1 GP
81

c) Explain terms Tautology and Contradiction in truth table with an example.

.3
CE

[5]
84

OR
6
3.1

Q2) a) By using mathematical induction show that 1+2+3+.....+n = n(n+1)/2

10

for all natural number values of n. [6]

P.T.O.
 b) Explain following terms with example. [4]

i) Symmetric difference between set

3
6:0
ii) Union of set

:3
iii) Intersection of Set

10
/01 71
23
iv) Subset of a Set

8
/20
.38 13
c) A college Records gives following information : 119 students enrolled in
Introductory computer science, 96 of them took data structures, 53 took
0
16
7.1 GP
foundations, 39 took assembly language, 31 took both foundation and
Assembly language, 32 took both data structures and Assembly language,
CE
84

38 took data structures and foundations and 22 took all of three courses
is this information correct? Why? [5]
6

3
3.1

Q3) a) What is Equivalence relation? Explain properties of binary relations. [5]

6:0
10

:3
b) Let A={1,2,3,4} and R={(1, 2), (2, 4), (1, 3), (3, 2)}, Find transitive

10
1/2 1
closure of relation R using Warshall’s algorithm. [5]

3
7
02
8 1 38

c) Let A = {1, 2, 3, 4, 12}=B, and let aRb if a divides b, Write a relation and
draw it’s Hasse diagram. [5]
4.3 01
6/0

OR
GP

Q4) a) Let f(x)=2x+3, g(x)=3x+4, h(x)=4x find gof, fog, foh, goh [5]
CE
8
7.1

b) A = {1, 2, 3, 4, 5, 6} = B
6

:03
3.1

R = {(i, j) ||i – j| = 2} 6
10

0:3

Find whether R is equivalence relation or not [5]

31
1/2 1
7

c)
02
38
01
6/0
7.1 GP
.3 81
CE
84

Find whether above posets are lattices or no? [5]

6
3.1

  
10

[5931]-30 2