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

Be Information Technology Engineering Semester 3 2022 November Discrete Mathematics DM Pattern 2019

1) The document contains 8 questions related to discrete mathematics topics such as shortest path algorithms, spanning trees, graph theory, and binary relations. 2) It provides examples of concepts like rooted trees, spanning trees, binary trees, and Hamiltonian/Euler paths and circuits. 3) The questions involve tasks like finding shortest paths using Dijkstra's algorithm, constructing optimal trees, determining reflexive/symmetric closures of relations, and analyzing directed graphs.

Uploaded by

opmax0077
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
0% found this document useful (0 votes)
81 views

Be Information Technology Engineering Semester 3 2022 November Discrete Mathematics DM Pattern 2019

1) The document contains 8 questions related to discrete mathematics topics such as shortest path algorithms, spanning trees, graph theory, and binary relations. 2) It provides examples of concepts like rooted trees, spanning trees, binary trees, and Hamiltonian/Euler paths and circuits. 3) The questions involve tasks like finding shortest paths using Dijkstra's algorithm, constructing optimal trees, determining reflexive/symmetric closures of relations, and analyzing directed graphs.

Uploaded by

opmax0077
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/ 4

Total No. of Questions: 8] SEAT No.

8
23
PA-1242 [5925]-265
[Total No. of Pages : 4

ic-
tat
S.E. (IT)

3s
DISCRETE MATHEMATICS

3:2
(2019 Pattern) (Semester-III) (214441)

02 91
3:5
0
Time : 2½ Hours] [Max. Marks : 70

31
2/0 13
Instructions to the candidates:
1) Answer Q.1, or Q2, Q3 or Q4, Q5 or Q6, Q7 or Q8.
0
2/2
2) Figures to the right indicate full marks.
.23 GP
E
80

8
Q1) a) Find the Shortest Path algorithm using Dijikstra’s Shortest path algorithm.
C

23
[6]

ic-
16

tat
8.2

3s
.24

3:2
91
49

3:5
30
31
01
02
2/2
GP
2/0

b) Construct an optimal tree for the weights 3, 4, 5, 6, 12 Find the weight


CE
80

8
of the optimal tree. [6]

23
.23

c) Find the maximum flow for the following transport network. [6]
ic-
16

tat
8.2

3s
.24

3:2
91
49

3:5
30
31
01
02
2/2
GP
2/0

OR
CE
80
.23

Q2) a) Define Following with examples: [6]


16

i) rooted tree
8.2

ii) Spanning tree


.24

iii) Binary Tree


49

P.T.O.
b) Use nearest Neighbourhood method to solve Travelling Salesman

8
23
problem. [6]

ic-
tat
3s
3:2
02 91
3:5
0
31
2/0 13
0
2/2
.23 GP
E
80

8
C

23
c) Explain Hamiltonian and Euler path and circuits with example. [6]

ic-
16

tat
8.2

3s
Q3) a) X = {2, 3, 6, 12, 24, 36} and x<=y iff x divides y. Find [6]
.24

i) Maximal Element
3:2
91
49

ii) Minimal Element


3:5
30

iii) Draw the graph and its equivalent hasse diagram for divisibility on
31

the set: {2, 3, 6, 12, 24, 36}.


01
02

b) What are the ordered pairs in the relation R represented by the directed
2/2
GP

graph shown in below Figures? [6]


2/0
CE
80

8
23
.23

ic-
16

tat
8.2

3s
.24

3:2
91
49

3:5

c) Let functions f and g be defined by [5]


30
31

f (X)  2X  1,g(X)  X 2  2
01
02

Find
2/2
GP

i) gof (4) and fog (4)


2/0
CE

ii) gof (a+2) and fog (a+2)


80

iii) fog (5)


.23

iv) gof (a+3)


16

v) gof (a+4)
8.2

OR
.24
49

[5925]-265 2
Q4) a) What is the reflexive closure of the relation R = {(a, b) | a<b} on the set

8
23
of integers and symmetric closure of the relation R = {(a,b) | a>b} on the

ic-
set of positive integers? [6]

tat
b) Determine whether the relations for the directed graphs shown in Figure

3s
are reflexive, symmetric, antisymmetric, and/or transitive. [6]

3:2
02 91
3:5
0
31
2/0 13
0
2/2
.23 GP

c) Let X = {a, b, c). Define f: X->X such that f ={(a,b), (b, a), (c, c)} [5]
E
80

8
Find
C

23
ic-
i) f-1
16

tat
ii) f-1 of
8.2

3s
iii) fof-1
.24

3:2
91
49

3:5
Q5) a) Solve the congruence 8x = 13mod 29 [6]
30

b) For each pair of integer a and b, find integers q and r such that
31

a = bq + r such that 0 <= r <|b|, where a is dividend, b is divisor, q is


01
02

quotient and r is remainder. [8]


2/2
GP

i) a = -381 and b=14


2/0

ii) a = -433 and b = -17


CE
80

c) Find all positive divisors of [4]

8
23
i) 256 = 28
.23

ii) 392 = 23. 72 ic-


16

tat
OR
8.2

3s

Q6) a) Which of the following congruence is true? Justify the answer. [6]
.24

3:2

i) 446  278 (mod 7)


91
49

ii) 793  682 (mod9)


3:5

iii) 445  536 (mod 18)


30
31

b) Compute GCD of the following using Euclidian algorithm. [6]


01
02

i) GCD (2071, 206)


2/2
GP

ii) GCD (1276, 244)


2/0

c) Using Chinese Remainder Theorem, find the value of P using following


CE
80

data. [6]
.23

p=2 mod 3
p=2 mod 5
16

p=3 mod 7
8.2
.24
49

[5925]-265 3
Q7) a) Let R = {0o, 45o, 90o, 135o, 180o, 225o, 270o, 315o} and *= binary

8
23
operation, so that a*b is overall angular rotation corresponding to

ic-
successive rotations by a and then by b. Show that (R,*) is a Group.

tat
[9]

3s
b) Let l be the set of all integers. For each of the following determine whether

3:2
*is an commutative operation or not: [8]

02 91
i) a*b=max(a,b)

3:5
ii) a*b=min(a+2,b)

0
31
2/0 13
iii) a*b=2a-2b
iv) a*b= min (2a-b, 2b-a)
0
2/2
v) a*b= LCM (a,b)
.23 GP

vi) a*b=a/b
E

vii) a*b=power (a,b)


80

8
C

23
viii) a*b=a 2 + 2b+ab

ic-
OR
16

Show that set G of all numbers of the form a+b  2, a, b l forms a

tat
Q8) a)
8.2

group under the operation addition i.e.(a+b 2) + (c+d 2) = (a+c) +

3s
(b+d) 2.
.24

3:2
[9]
91
49

b) Determine whether the set together with the binary operation is a


3:5
30

semigroup, group a monoid, or neither.


31

S= {1, 2, 5, 10, 20}, where a*b is defined as GCD (a,b) [8]


01
02
2/2
GP
2/0
CE
80

8

23
.23

ic-
16

tat
8.2

3s
.24

3:2
91
49

3:5
30
31
01
02
2/2
GP
2/0
CE
80
.23
16
8.2
.24
49

[5925]-265 4

You might also like