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

CEGP013091: 49.248.216.238 21/06/2022 08:52:29 Static-238

The document is a test paper for the subject of Discrete Mathematics. It contains 8 questions with various subparts related to topics in discrete mathematics like graph theory, recurrence relations, functions, and relations. The test has a maximum time of 2.5 hours and carries a total of 70 marks.

Uploaded by

raju
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)
75 views

CEGP013091: 49.248.216.238 21/06/2022 08:52:29 Static-238

The document is a test paper for the subject of Discrete Mathematics. It contains 8 questions with various subparts related to topics in discrete mathematics like graph theory, recurrence relations, functions, and relations. The test has a maximum time of 2.5 hours and carries a total of 70 marks.

Uploaded by

raju
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
P652 [Total No. of Pages : 4

ic-
tat
[5869] - 281

9s
2:2
S.E. (Information Technology)

02 91
8:5
DISCRETE MATHEMATICS

0
20
1/0 13
(2019 Pattern) (Semester - III)
0
6/2
Time : 2½ Hours] [Max. Marks : 70
.23 GP

Instructions to the candidates :


E
82

1) Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.

8
C

23
2) Figures to the right indicate full marks.

ic-
3) Draw neat diagrams wherever necessary.
16

tat
4) Use of scientific calculators is allowed.
8.2

9s
5) Assume suitable data if necessary.
.24

2:2
91
49

8:5
Q1) a) What are various operations on Graph? Explain it in detail? [4]
30
20

b) Find the maximum flow in the given network. [8]


01
02
6/2
GP
1/0
CE
82

8
23
.23

ic-
16

tat
8.2

9s
.24

2:2
91
49

8:5
30
20

c) Find the shortest path using Dijikstra's algorithm. [6]


01
02
6/2
GP
1/0
CE
82
.23
16

OR
8.2

P.T.O.
.24
49
Q2) a) Let 'G' be a connected planar graph with 20 vertices and the degree of

8
each vertex is 3. Find the number of edges and regions in the graph. [6]

23
ic-
b) Explain the following types of graphs with the help of examples : [6]

tat
i) Bipartite Graph ii) Complete Graph

9s
2:2
iii) Regular Graph iv) Spanning Subgraph

02 91
8:5
c) Find under what conditions Km, n the complete bipartite graph will have

0
an Eulerian circuit.

20
[6]
1/0 13
0
6/2
.23 GP

Q3) a) Suppose that the relation R on a set is represented by the matrix MR. Is
R reflexive, symmetric, and/or anti-symmetric? [6]
E
82

8
C

23
é 1 1 0ù
ê ú

ic-
ê 1 1 1ú
16

ê ú

tat
ê 0 1 1ú
8.2

9s
ë û
.24

2:2
b) Find the homogeneous solution for the recurrence relation
91
[6]
49

8:5
An – 6 an-1 – 11 an-2 + 6an-3 with a0 = 2, a1 = 5, a2 = 15
30
20

c) Let f(x) = x + 2, g(x) = x-2, h(x) = 3x, for x  R where R is the set of real
01
02

numbers Find i) gof ii) fog iii) fof iv) hog v) gog. [5]
6/2
GP

OR
1/0
CE

Q4) a) Find Relation Matrix,


82

[6]

8
23
.23

i) If A = {1, 2, 3, 4, 5, 6} and a R b iff a divides b for a, b A.


ic-
16

R = {(a, b)/a < b} for a, b A.


tat
ii)
8.2

9s

b) Let A = {1, 2, 3, 4}, B = {a, b}, and R = {(1, a), (2, a), (3, a), (4, a)},
.24

2:2

S = {(4, a), (4, b), (3, a), (3, b)} [6]


91
49

8:5

Find
30
20

i) A×B ii) ~R
01
02

iii) ~S iv) ~R  ~S
6/2
GP
1/0

c) Describe : [5]
CE
82

i) Identity function
.23

ii) Composite function


16

iii) Inverse function


8.2
.24

[5869] - 281 2
49
Q5) a) Find the prime factorization of each of the following integer. [6]

8
i) 6647 ii) 45500

23
ic-
iii) 10!

tat
b) Find integers p and q such that 51p + 36q = 3 using [6]

9s
Extended Euclidian algorithm. Also find GCD.

2:2
c) Find the values of the following using modular arithmetic. [6]

02 91
i) 77 mod 9

8:5
0
ii) 3110 mod 13

20
1/0 13 OR
0
Q6) a) Solve the following using Fermat's Little theorem. [6]
6/2
.23 GP

i) 769 mod 23
ii) 3101 mod 13
E
82

8
b) Find Euler Totient Function of the following numbers. [6]
C

23
i) 75 ii) 5488

ic-
iii) 77
16

tat
8.2

c) Compute GCD of the following using Euclidean algorithm. [6]

9s
i) GCD (831, 366)
.24

2:2
91
ii) GCD (2222, 1234)
49

8:5
30
20

Q7) a) Consider the (2, 6) encoding function e. e(00) = 100000, [7]


01
02

e(10) = 101010
6/2

e(01) = 001110, e(11) = 101001


GP
1/0

Find minimum distance of e.


CE

How many errors will e detect?


82

8
23
b) Let R = {0°, 60°, 120°, 180°, 240°, 300°} and * = binary operation, so
.23

that a *b is overall angular rotation corresponding to successive rotations ic-


16

tat
by a and then by b. Show that (R,*) is a Group. [6]
8.2

9s

c) Prove that the following table on relation of elements of set [4]


.24

2:2

G = {0, 1, 2, 3, 4, 5} multiplication mod 6 is not a group.


91
49

8:5

0 1 2 3 4 5
30
20

0 0 1 2 3 4 5
01
02

1 1 2 3 4 5 0
6/2
GP

2 2 3 4 5 0 1
1/0
CE
82

3 3 4 5 0 1 2
.23

4 4 5 0 1 2 0
16

5 5 0 1 2 3 4
8.2
.24

[5869] - 281 3
49
OR

8
23
Q8) a) Determine whether description of * is a valid definition of a binary

ic-
operation on the set. [6]

tat
i) On R, a*b = ab (ordinary multiplication)

9s
2:2
ii) On Z +, a*b = a/b

02 91
8:5
iii) On Z, a*b = ab

0
20
iv) 1/0 13
On Z+, a*b = a–b
0
v) On Z, a*b = 2a+b
6/2
.23 GP

vi) On R, a*b = ab/3


E
82

b) S = {1, 2, 3, 6, 12}, where a*b is defined as LCM (a, b).

8
[7]
C

23
Determine whether it is an Abelian Group or not.

ic-
16

tat
c) Define Ring. [4]
8.2

9s
.24


2:2
91
49

8:5
30
20
01
02
6/2
GP
1/0
CE
82

8
23
.23

ic-
16

tat
8.2

9s
.24

2:2
91
49

8:5
30
20
01
02
6/2
GP
1/0
CE
82
.23
16
8.2
.24

[5869] - 281 4
49

You might also like