72

86

E4

FA
78
Paper / Subject Code: 50395 / Computer Graphics

8C

63

29

CB

72
86

E4
90

FA
78
8C
E2

63

29

CB

72
86

E4
27

90

78
8C
1D

63

29
E

B
6

4
7

90
(3 Hours) Total Marks: 80

20

9C
C8

3E
2
1D

2
1A

7E

66

2
08

E4
20
37

C
8
2

29
N.B: 1) Question number 1 is compulsory.

8C
D

63
1A

29
FA

E
1

86

E4
27

90
20
2) Attempt any three out of the remaining.

7
72

8C
1D

E2

63
1A
FA
78
3) Assume suitable data if necessary and justify the assumptions.

6
7

90
20
37
CB

72

C8
2
4) Figures to the right indicate full marks.

1D

E2
1A
A
78
29

8
F

90
0
7
B

2
E4

8
2
2
3
7
C

8C
1D

E2
1A
FA
78
63

29

27

90
20
Q1

37
B

72
86

C
3E

1D

E2
1A
A
78
8C
A Explain image space and object space [5]

F
66

42

7
20
37
B

2
90

D2
B What is computer graphics and explain its applications [5]

7
9C
8

1A
FA
78
C
E2

63

1
42
8
C What are homogeneous coordinates and discuss its use in computer graphics [5]

0
7
CB

72
6
27

D2
A2
A3
8

E
9

8
D Explain point clipping with suitable example 8C [5]
1D

63

01
71
B7

2F
E

42
86
7

0
0

A2
A3
87
9C
E
2

29
A2

C
1D

71
B7

2F
E

42
Q2 08
71

6
7
0

A3
87
9C
C8

E
2

9
2
A3

A Explain mid point ellipse drawing method for region I with suitable diagrams [10]
D

E2

63
A

B7

2F
42
08
1
71
2F

86
7
0

B Given a triangle ABC with coordinates A (10,10), B (100,10), C(10,100). [10]

87
9C
3E
2

9
2
A3
87

C
1D

E2
1A

Rotate the triangle by 900 Find the new coordinates of the triangle.

B7
66

42
08
B7

2F

27
20
37

9C
C8

3E
9
87
9C

2
A
FA

66

42
08
01
1
B7
42

7
Q3
7
72

C8

3E
D2

9
2
3
9C
3E

E2
1A
A
8

A Explain area subdivision method with suitable example. [10]

66
08
01
B7

F
66

42

27
37
2

C8
29
A2

B Explain antialiasing techniques in detail [10]

7
9C
C8

3E

D
A
8

7E

08
01
1
7

F
66

42
08

7
B

72

D2

29
A2
3
C
C8

3E
29

FA
8

Q4
7E
29

01
71
7
7E

66
08

72
4

D2
A2

A Explain Liang Barsky line clipping method with suitable example [10]
A3
C
C8

E
D2

29

78
3

01
71
2F
7E

B Explain and write matrices for 3D rotation about X, Y and Z axes

66

[10]
08
01

B
4

A2
A3
87
9C
C8

E
D2

29
A2

71
B7

2F
7E

2
08
01
71

E4

Q5
A3
87
9C
8
D2

29
A2
A3

8C

63

B7

2F

A Derive the 2D transformation matrix for rotation with respect to fix point.
7E

[10]
42
01
71

86
90

87
9C
3E
D2
A2
3

B Calculate all the points on the line from point A(8,10) to point B(16,14) using [10]
C
2
FA

B7
7E

42
8
01
71

6
0

DDA line drawing method

72

9C
C8

3E
D2

9
A2
A3

2
78

66

42
8
01
71
2F

90
CB

C8

3E
D2
A2
A3

Q6
87

E2

66
08
1
71
B7

2F

A What is window and viewport. Derive the transformation matrix for a window-to- [10]
27
0

C8
29
2
A3
87
9C

D
1A

viewport transformation
E

08
1
B7

2F
42

7
0
37

D2

29
A2

B Discuss traditional animation techniques [10]

87
9C
3E

FA

7E
01
71
B7
66

42

72

D2
A2
A3
9C
C8

3E

78

01
71
2F
66

CB
E4

A2
A3
87
C8

_____________________
63

29

71
B7

2F
08

86

E4

A3
87
9C
29

8C

63

B7

2F
7E

42
86
90

87
9C
3E
D2

8C
E2

B7
66

42
27

90

9C
C8

3E
1D

E2

66

42
08
27
20

C8

3E
29
1D
1A

7E

66
08

29878 Page 1 of 1
20
37

C8
D2

29
1A

7E

08
01
37

D2

29

371A201D27E2908C8663E429CB7872FA
A2
 E
96
3

6
C

AE
03

29
Paper / Subject Code: 50394 / Digital Logic & Computer Architecture

0B
0B
8

CA

66
AA

96
3

AE
03

29
0B
0B
40

CA

66
AA

96
3
(3 hours) Total Marks: 80

03

29
D9

0B
0B
40

CA
16

AA

96
3
0
N.B. 1. Question No. 1 is compulsory

03
D9
3

0B
0B
A5

40
2. Attempt any three questions from remaining five questions

8
16

AA

96
3
0

C
E1

03
3. Assume suitable data if necessary and justify the assumptions

D9
3

0B
0B
A5

40

8
AE
4. Figures to the right indicate full marks

16

AA

96
3
0
E1

03
D9
66

0B
A5

40

8
AE
29

16

AA
Q1 A Differentiate between Computer organization and computer architecture 05

3
0
E1

03
CA

D9
66

3
A5

40

8
AE
29
B Draw
Q1 the flow chart for of Restoring division algorithm 05

16
0B

AA
0
E1

03
CA

D9
66

3
96
C Differentiate between Hardwired control unit and Micro programmed control unit 05

A5

40

8
AE
29

16
0B

AA
0B

0
D Explain IEEE 754 floating point representations. 05

E1
CA

D9
66

3
96
33

A5

40
AE
29

16
0B
0B
0

0
E1
A8

CA

D9
66
Q2 A Draw the flow chart Booths algorithm for multiplication and Perform 6 10

53
x2

96
33

AE
0A

29

1A

16
0B
0B
0
B Describe the detailed Von-Neumann Model with a neat block diagram
A8

05

CA

D9
66
4

53
E
96
33
90

AE
0A

C Explain Cache coherence 05

29

1A

16
0B
0B
0
D

A8

CA

66
4

53
16

E
96
33
90

AE
0A

29

1A
53

0B
0B
Q3 A Explain the different addressing modes. 0 10
D

A8

CA

66
1A

4
16

E
96
33
90

AE
0A

29
B Define Instruction cycle and draw the state diagram of instruction cycle 05
53
EE

0B
0B
0
D

A8

CA

66
1A

4
16

C Explain Bus arbitrations 05

96
33
6A

90

0A

29
53
EE

0B
0B
0
D
96

A8

CA
1A

4
16

96
33
6A
A2

Q4 A Explain Micro instruction format and write a micro program for the instruction 10
90

0A
53
EE

0B
0B
0
D
96
BC

MUL R1 , R2
A8
1A

4
16

96
33
6A
A2

90

B Explain Hardwired Control Unit and the various design methods associated with it. 10
60

0A
53
EE

0B
0
D
96
BC

A8
B9

1A

4
16

33
6A
A2

90
60
30

0A
53
EE

0
D
96
BC

Q5 A Explain various Memory mapping techniques 10

A8
B9
03

1A

4
16
6A
A2

90
A8

60
30

0A
53
EE

B Explain the concept of Locality of reference 05

D
96
BC
B9
03
0A

1A

4
16
6A
A2

90
A8

60
0

C List & Explain the Characteristics of Memory 05

4

53
EE
33

D
96
90

BC
B9
0A

1A

16
80

A
A2
6D

0
0

66
4

53
EE
AA

96
33
90

BC

A Explain Flynn’s classification.

31

Q6 10
9

1A
0B
0

6A
A2
6D
A5

40

A8

E
96
33

96
0

B Describe Instruction Pipelining and its hazards. 10

BC
1

AE
0A
D9
53

0B
0

A2
A8

66
1A

4
16

96
33
90

BC
0A

9
3
EE

0B
0

*****************
A2
6D
A5

A8

60
4

33
6A

90

BC
1
E1

B9
0A
53

0
6D
96

A8
AE

0
30
1A

96
90
1

03
0A
66

53
EE

0B
6D

8
29

1A

AA

33
6A

90
1
CA

53
EE

0
6D
96

40

A8
1A
B

6A
A2

0
1
60

0A
D9
53
EE
96
BC
B9

1A

4
16
6A
A2

90
60

3
EE

6D
96

A5
BC
9
0B

6A
A2

1
E1
60

53
33

96
BC

AE
9

1A
0B
80

A2
60

66

EE
AA

33

BC
9

29
0B
0

6A
A8

60

CA
33

96
9
0A

0B
0B
0

A2
A8
4

96
33
90

BC
0A

0B
0
6D

32289
A8

60
4

33
90
31

9
0A

0B
0
6D

A8
04

33
1

0A
D9

A5316D9040AA80330B960BCA2966AEE1
53

80
 E

B3
85

3A
5
4F

A5
Paper / Subject Code: 50393 / Data Sturcture

F3

97
E4
FF

B3
85

5
4F
5A

A5

3
8

F3

97
E4
FF
78

B3
85

5
4F
5A
15

A5
8

F3
E4
FF
EA

78

B3
85
4F
5A
15
78

F3
E4
FF
EA

78
9D

85
(3 Hours) Total Marks: 80

B
4F
5A
15
78
3A

F3
E4
FF
EA

78
9D

85
7
N.B: (1) Question No. 1 is compulsory

4F
5A
59

15
78
3A

8
E4
FF
A5
(2) Attempt any three questions out of the remaining five questions

EA

78
9D
7

4F
5A
59
(3) Figures to the right indicate full marks

15
B3

78
3A

FF
A5

EA

78
F3
(4) Make suitable assumptions wherever necessary with proper justifications

9D
7

4F
5A
59

15
B3
85

78
3A

FF
A5

EA
48

78
F3

9D
Q1 A What is Hashing? Explain Hash collision with example. [05]

5A
59
FE

15
B3
85

78
3A
B Explain types of Double Ended Queue with example. [05]

A5

EA
48

78
F4

F3

9D
7
C Differentiate between arrays and linked list. [05]

59
FE

15
B3
AF

85

78
3A
A5

EA
48
4
D List different data structures along with one application. [05]

F3

9D
85

7
FF

59
FE

15
B3
85

78
57

3A
A

A5

EA
48
4

F3

9D
A1

85

7
Q2 A Construct Binary Search Tree by inserting the following elements in sequence [10]
FF

59
FE

B3
85

78
57

3A
E

45, 28, 34, 63, 87, 76, 31, 11, 50, 17.

A5
78

48
4

F3

9D
A1

85

7
FF
9D

59
FE

B3
B Write a program in C to implement Queue using singly linked list. [10]

85
57

3A
E

A5
78
3A

48
4

F3
A1

85

7
FF
9D

59
FE

B3
85
97

57
E

Q3 A Write a program to perform the following operations on doubly linked list: [10]
A

A5
78
3A

48
4
55

F3
A1

85

FF
i) Insert a node at the front of the list
9D

FE

B3
3A

85
97

57
E

ii) Delete a node from the front of the list A

78
3A

48
4
55

F3
A1
B

85

FF
F3

9D

iii) Count the number of nodes in the list

FE
3A

85
97

57
E

A
5

78
3A

48
4
55

iv) Display the list

A1
B
88

85

FF
F3

9D

FE
3A

97
E4

57
B Define Graph. Show the adjacency matrix and adjacency list representation for [05]
E

A
5

78
3A

4
55

A1
B
F

88

the following graph 85

FF
F4

F3

9D
3A

97
E4

57
E

A
F

78
3A
55

A1
B
F

88

85
5A

F4

F3

9D
3A

97
E4

57
E
8

78
57

3A
55

A1
B
F

88
5A

F4

F3

9D
A1

3A

7
E4

E
78

59
F

78
3A
8E

B
4F

88
5A
15

A5
F3

9D
D7

97
E4
FF
EA

78

B3
5

3A
55
A9

4F

88
5A
15
8

F3

3A
D7

97

C Explain stack overflow and underflow conditions with example. [05]

E4
FF
EA

78

55
3B
A9

4F

88
5A
5
8

A1

3A
D7

E4
FF

5F
3

78

Q4 A Write an algorithm to check the well-formedness of parenthesis. [10]

97

8E

3B
A9

4F

88
5A
5
55

A1

B Show the result of inserting the elements 16, 18, 5, 19, 11, 10, 13, 21, 8, 14 one [10]
7

E4
FF

5F
3

78
9D
3A

97

8E

at a time into an initially empty AVL tree.

F

88
5A
5
3A

F4
55

A1
7

E4
78
9D
3A

F
97

8E

F
5A

Q5 A Define tree traversal. Explain binary tree traversal techniques with example. [10]
5
3A

F4
55

A1
3B

78
9D

B A hash table of size 10 uses linear probing to resolve collisions. The key values [10]
3A

F
97
5F

8E

5A
15

are integers and the hash function used is key%10. Draw the table that results
3A
55
3B
88

EA

78
9D
3A

after inserting in the given order the following values:

97
E4

15
85

8
3A
55
3B

28, 55, 71, 38, 67, 11, 10, 90, 44, 9

D7

EA
48

3A

97
F

A9
FE

85

8
55
3B

D7

Q6 A Explain Depth First Search and Breadth First Search traversal of a graph with [10]
3
48
F4

3A

97
F

A9

example.
FE
AF

85

55
3B

3
48
F4

B Construct Huffman tree and determine the code for each symbol in the string [10]
5

3A

97
F
78

FE

“PROGRAMMING”.
AF

85

55
3B
48
F4
85

3A

**************
5F
FE
AF
57

3B
88
F4
A1

85

E4

F
AF

85

30156 Page 1 of 1
57
8E

4F

48
A1

5
D7

FF
78

FE
E

A
15
78

F4
85
EA
9D

9D78EA15785AFF4FE4885F3B3A55973A
AF
57
 7
3
0
0

8D
B5
D3
3F

2E
Paper / Subject Code: 50392 / Discrete Structures & Graph Theory

35
00
B2

08

24

8D
B5
D3
3F

2E
CA

35
00
B2

08

24
48

B5
D3
F

E
A
F7

23

82
C

00
4
A1
Time:3Hours Max. Marks: 80

48

D3
F

2E
CA
7
D2

3
1F

08

24
48

B
71
N.B.

3
3F

2E
A
7

4D
D2
8D

8C
1) Q.1 is compulsory.

1F

B2

08

2
1
35

4
2) Solve any 3 questions out of remaining 5 questions.

3F

2E
CA
7

F7
2
8D
B5

08
3) Assumptions made should be clearly stated.

A1

48

B
71
5
00

3F
A
4) Draw the figures wherever required.

F7
2
8D
5
D3

8C
D

2
B

AB
1
5
00

4
24

F
D7
3

7
2

23
Q.1 Solve any four of the following questions.

B5
D3

8C
1F
2E

1D
58

AB
a) Check if (p→q)→[(~p→q)→q] is a tautology?

00
5

2A
08

4
24

D7
53

F7
D3

8C
3F

D
0B

1
2

1
5
B2

A
8

74
4
b) Draw the Hasse diagram for [{2,4,5,8,10,12,20,25}, /]. Is it a Poset? 5

D7
3
0
0

2
5
D3
F

1F
E
CA

1D
0B

58
3

2
B2

A
08

4
24

7
53
48

F7
c) Define Eulerian and Hamiltonian Graph. Give examples of following type of graph 5

D2
8D
D3
3F

E
A

0B
7

A1
2
i) Eulerian but not Hamiltonian
C
1F

1
5
B2

D7
53
48

30
0

D2
2A

ii) Not Eulerian but Hamiltonan

3F

E
CA

0B
7

4D

58
82
1F

71
D

3
48

30
B

E2
71

8D
2A

B5
3F
d) Explain types of Quantifiers . Represent the following sentences using Quantifiers 5
A
7

D
82
8D

8C
F

35
D

00
2

4
i) All hardworking students are clever.
1

AB

E2
71
35

B5
4

D3
3F
7

ii) There is a student who can speak Hindi but does not know Marathi
2

82
8D
B5

8C
F
1D

00
2

4
A1

F0

E2
35
00

D3
CA
7

F7
2

82
8D

e) State the Pigeonhole principle and prove that in any set of 29 persons at least five
B5
D3

B2

24
1

F0
1
35

persons must have been born on the same day of the week 5
00

74
24

2E
CA
D7

23
B5
D3

1F
2E

1D

08
58

48

B
00

2A
08

24

3F
Q.2
CA
7
53

F7
D
D3
F

2E

B2
0B

a) Show that the set of all positive rational numbers forms an abelian group 10
58
23

48
1

A
08

24

CA
D7
3
0
AB

under the composition * defined by a*b=(ab)/2

7
D2
5
D3
F

1F
2E

0B

58
23

48
C

71

2A
08

24

3
48

30
AB

F7
8D

a) What is a transitive closure? Explain Warshall's algorithm for finding transitive

B5
3F

2E

1D
F7

A1
8C

closure with an example. 10

00
B2

08

D7
1

3
2

D2
2A

5
74

3
F

E
CA

0B
4D

58
23

82
1F

71
1D

Q.3
3
8

30
AB

E2

8D
2A

B5
74

3F

a) By using mathematical induction, prove that the given equation is true for all positive
D
82
C
1F

35
1D

00
B2

4
48

integers. 6
0

2
2A

B5
D3
F

2E
CA
D7

F7

1 x 2 + 3 x 4 + 5 x 6 + …. + (2n - 1) x 2n = n(n+1)(4n−1)/3
3
1D

00
2

08

24
58

A1

B
74

D3
3F

E
CA
7
53

D2

82
8D

1F

b) Define Lattice? Which of the following is lattice? 8

B2

24
0B

F0
71
35

2A

74

2E
CA

23
D
B5

F
1D

08
58

A1

48

AB
00

3F
7
53

F7
D2
8D
3

8C

B2
0B
4D

1
71
35

74

CA
30
E2

D2
D
B5

1F
4D

58
82

48
71
00

2A
53

F7
E2

D
D3

1D
0B

58

A1
82

24

D7
53
30
0

D2
3F

2E

0B
4D

58

71
B2

08

3
30
E2

8D
B5
F
CA

4D
23

82

c) Determine the sequence of which recurrence relation is an = 2an-1 – an-2 with initial
35
00
AB

E2

B5
D3
3F

conditions a1= 1.5, a2= 3. 6

82
C

00
2

24
48

AB

D3
3F

2E
F7

8C

08

24
A1

AB
74

2E
D2

23
8C
1F

08

31044 Page 1 of 2
AB
2A

74

3F
8C
1F

1D2A1F748CAB23F082E24D300B5358D7
1D

B2
 7
3
0
0

8D
B5
D3
3F

2E
Paper / Subject Code: 50392 / Discrete Structures & Graph Theory

35
00
B2

08

24

8D
B5
D3
3F

2E
CA

35
00
B2

08

24
48

B5
D3
F

E
A
F7

23

82
C

00
4
A1
Q.4

48

D3
F

2E
CA
7
D2
a) Let A={1, 3,6,9,15,18,21} & R be the relation of divisibility. 8

3
1F

08

24
48

B
i) Write the pairs in a relation set R.

71

3
3F

2E
A
7

4D
D2
8D

8C
ii) Construct the Hasse diagram.

1F

B2

08

2
1
35

4
iii) What are the Maximal and Minimal elements?

3F

2E
CA
7

F7
2
8D
B5

08
iv) Is this poset a distributive lattice? Justify your answer.

A1

48

B
71
5
00

3F
A
3

F7
2
8D
5
D3

8C
D

2
B
b) 6

AB
1
5
00

4
24

F
D7
3

7
2

23
B5
D3

8C
1F
2E

1D
58

AB
00

2A
08

4
24

D7
53

F7
D3

8C
3F

D
0B

1
2

1
5
B2

A
8

74
4

D7
3
0
0

2
5
D3
F

1F
E
CA

1D
0B

58
3

2
B2

A
08

4
24

7
53
48

F7
D2
8D
D3
3F

E
A

0B
7

A1
2
C
1F

1
5
B2

D7
53
48

30
0

D2
2A

c) Write a short note on Types of Graphs. 6

3F

E
CA

0B
7

4D

58
82
1F

71
D

3
48

30
B

E2
71

8D
2A

B5
3F
A

Q.5
7

D
82
8D

8C
F

35
D

00
2

4
a) Let(Z,*) be an algebraic structure, where Z is set of integers and the operation * is
1

AB

E2
71
35

B5
4

D3
3F
7

defined by a*b= maximum of (a,b). Is (Z,*) a Semigroup? Is (z,*) a Monoid?

2

82
8D
B5

8C
F
1D

00
2

4
A1

Justify your answer. B 8

F0

E2
35
00

D3
CA
7

F7
2

82
8D
B5
D3

B2

24
1

F0
1
35
00

b) Define the term Surjective function. Let E be the set of all even numbers then
A

74
24

2E
CA
D7

23
B5
D3

1F
2E

f: N-->E:f(x)=2x , check if it is surjective,bijective?Justify your answer. 4

1D

08
58

48

B
00

2A
08

24

3F
CA
7
53

F7
D
D3
F

2E

B2
0B

c) Give the examples of relation R on S = {a, b, c,d} having stated property. 8

58
23

48
1

A
08

24

CA
D7
3
0
AB

7
D2
5
D3
F

1F
2E

0B

58
23

48
i) R is an equivalence relation.
C

71

2A
08

24

3
48

30
AB

F7
8D

ii) R is symmetric but not transitive

B5
3F

2E

1D
F7

A1
8C

iii) R is both symmetric and antisymmetric

00
B2

08

D7
1

3
2

D2
2A

5
74

3
F

iv) R is neither symmetric nor antisymmetric.

CA

0B
4D

58
23

82
1F

71
1D

3
8

30
AB

E2

8D
2A

B5
74

3F

Q.6
D
82
C
1F

35
1D

00
B2

4
48

a) Define Isomorphic graphs and check whether the following graphs are Isomorphic ? 8
0

2
2A

B5
D3
F

2E
CA
D7

F7

3
1D

00
2

08

24
58

A1

B
74

D3
3F

E
CA
7
53

D2

82
8D

1F

B2

24
0B

F0
71
35

2A

74

2E
CA

23
D
B5

F
1D

08
58

A1

48

AB
00

3F
7
53

F7
D2
8D
3

8C

B2
0B
4D

1
71
35

74

CA
30
E2

D2
D
B5

1F

b)In a group(G,*) , Prove that the inverse of any element is unique and identity element
4D

58
82

48
71
00

2A

is also unique.
53

6
F7
E2

D
D3

1D
0B

58

A1

c) Define Relation. Let 6

82

24

D7
53
30

f: R→R is defined as f(x) =x2

0

D2
3F

2E

0B
4D

58

g: R→R is defined as g(x) =3x2+1

71
B2

08

3
30
E2

h: R→R is defined as h(x) =9x-2

8D
B5
F
CA

4D
23

82

35
00

find (hof)og, go(foh).

AB

E2

B5
D3
3F

*************
82
C

00
2

24
48

AB

D3
3F

2E
F7

8C

08

24
A1

AB
74

2E
D2

23
8C
1F

08

31044 Page 2 of 2
AB
2A

74

3F
8C
1F

1D2A1F748CAB23F082E24D300B5358D7
1D

B2
 F

CC

9
B

CA

78
E6
Paper / Subject Code: 50391 / Engineering Mathematics -III

D6

FE

C8
B8

62
07

CA

78
E6

EC
D6
0D

C8
B8

62

AF
07
47

E6

EC
D6
0D
7C

C
8

F
7
7
72

A
0
4

E6
D6
D
C
48

2C
70
27

B8
(Time: 3 hours) Max. Marks: 80

07
9B

66

A
4
87

6
D
C
89

C
8E
7D
4

70
7

62
9B
87

72

6B
0
4

6
0D
C
N.B. (1) Question No. 1 is compulsory.

7C
48
89

E
7D
EC

B8
9B
87

47
72

D0
F

D6
(2) Answer any three questions from Q.2 to Q.6.

C
48
9
CA

78

70
C

7
B

2
E

0
8

C4
7
9
62
(3) Figures to the right indicate full marks

AF

D6
D
CC

8
9

B4
8
E6

0
27

07
2C

87

47
E
Q.1 a) Find ( )

7
9
B8 [5]

AF

D
CC

C
48
89
66

0
Q.1 b) Find the Fourier series for ( )

7
D6
in ( ) [5]

B
2C

87
8E

47
2
E

87
9
AF
07

Q.1 c) Find Karl Pearson’s coefficients of correlation between X and Y from

CC

7C
9
B

66

B4
8
D6
0D

2C

7
8E

72
FE
the following data [5]

4
9
07
47

7C
8
9
B

B4
78
6

EC
D6
0D
7C

2C
8E

72
C8

99
AF
07
X 100 200 300 400 500
47
72

48
B

66

78
C
D6
0D
7C
48

9B
2C
8E
Y 30 40 50 60 70

C8
F
7
9B

47
72

89
6B

66

A
0

EC
0D
7C
48
89

87
E
Q.1 d) If ( ) ( ) ( ) 7D

AF
9B
87

47

CC
72

6
0

E6
D6
is analytic, then find [5]
0D
C

7C
48
89

2C

FE
EC

B8
7
9B
87

7
72

66

CA
0
4
AF

D6
0D
CC

7C
48
89

E
Q.2 a) A random variable X has the following probability function [6]

62
7
9B
2C

87

47
72

B
FE

D0

E6
D6
CC

7C
48
89
66

X 1 2 3 4 5 6 7
CA

70

B8
07
9B
87
8E

72

k2 k2+k 2k2 4k2

FE

k 2k 3k
4
62

D6
0D
CC

7C
48
89
6B

CA

P(X=x)
E6

07
9B
87

47
72
7D

FE

iii) ( )
B8

62

Find i) k, ii) P(X ),

0D
C

7C
48
89
CA
D0

E6

EC
D6

9B
87

47
72
70

B8

62

Q.2 b) Determine the analytic function whose real part is [6]

AF
07

CC

7C
48
89
C4

E6
D6
0D

B
2C

87

72
FE

Q.2 c) Evaluate∫
27

99
B8

. [8]
07
47

CC

48
66

CA
87

78
D6
0D
7C

9B
8E

E
B4

C8
62

AF
07
47
72

Q.3 a) Obtain the Fourier series for ( )

89
B

( ) in the interval (0, 2π) [6]

E6

EC
D6
0D
7C
48

2C

87
B8

AF
07
9B

47

CC
72

66

Q.3 b) A continuous random variable X has the p.d.f. ( ) [6]

D6
0D
7C
48
89

2C
8E

FE
07
9B
87

47
72

66

Find i) k, ii) ( )
CA
D6
0D
C

7C
48
89

8E
EC

62
07
9B
87

47
72

[( ] using partial fraction method

E6
D6

Q.3 c) Find [8]

0D
CC

7C
48
89

)( )
B8
7
9B
87

47
72
FE

D6

Q.4 a) Find [ ( )] ( ) ( )
0D
C

7C
48
89

[6]
CA

EC

07
9B
87

47
72
62

AF

Q.4 b) Compute Spearman’s rank correlation coefficient for the following data
0D
C

7C

[6]
48
89
E6

EC

9B
2C

87

47
72
AF

CC

7C
48

X 18 20 34 52 12
89
66

9B
2C

87
8E

72
FE

Y 39 23 35 18 46
CC

48
89
6B

66

CA

9B
87
8E
7D

FE
62

CC

89
6B

CA
D0

E6

87
7D

FE
B8

62

C
CA
D0

E6

EC
D6
70

B8

62

AF
07
C4

E6
D6
0D

2C
27

B8

31217 Page 1 of 2
07
47

66
87

D6
0D
7C

8E
07
47
72

6B
0D
7C
48

B48727C470D07D6B8E662CAFECC87899
7D
 87 D0 E6 EC B4
27 7D 62 C 87 87
C4 6B CA 89 27
48 70 8E FE 9B C4
72 D0 66 CC 48 70
7C 7D 2C 87 72 D0
47 6B AF 89 7C 7D
0D 8E EC 9B 47 6B
07 66 C 48 0D 8E
7C D6 2C 87 72 07 66
47 B8 AF 89 7C D6 2C
0D 9B 47 AF

31217
E6 EC B8
C 0D

X
07 62 48 E6 EC
87 72 07 C

Y
X
D6 CA 62

Q.5 a) Find

Q.5 b) Find
B8 FE 89 7C D6 CA 87
0D 9B 47 89

Q.6 b) Find )
E6 CC 0D B8 FE 9B
07 48

[(
62 87 72 E6 CC 48
[
D6 CA 07 62

5
72

[
7C

8
89 D6 87

11
B8 FE 9B 47 CA 89 7C

P(X = x) 1/8
E6 CC 0D B8 FE 9B 47
7D 62 48 E6 CC
CA 87 72 07 62 48 0D
6B 89 7C D6 87 72 07
]

6
FE CA
8E 9B B 89 7C

14
47 D6

]
) ]

66 CC 48 0D 8E FE 9B 47 B8
2C 66 CC 0D

12
87 72 07 48

1/6
E6

)
AF 89 7C D6 2C 87 72 07 62
( )

7C
Q.4 c) Obtain the Fourier series for

9B 47 AF 89 D6 7

Q.6 c) Prove that the function ( )

EC B8 CA
C 48 0D E6 EC 9B 47 B 14 F

[
87 72 07 C 48 0D 8E
{

62 EC
89 7C D6 CA 87 72 07 66 C
9B 47 B 89 87 7C 2C

(
16
D6

3/8
8

48 0D 8E FE 9B 89 47 B AF
15

72 0 7 66 48 CC 0D 8E E C
9B
7C D6 2C 87 72 0 7 66 C 48
47 B AF 89 7C
4
D6 2C 87 72
8E E B 7C

)]
0D 9B 7 AF 89
9

66 CC 48 0D 8E E 9B 47
12

07 6 4
20
2C 0 6 CC 0D 1/4
87 72

Page 2 of 2
D6 87
B8 AF 89 7C 7D
6B
2C 8 78 27 07
C

******************
E6 EC 9B 47
8E
AF
E 99B 4
D6
B
62 48 0D 7
Q.6 a) Find mean and variance for the following distribution

C8 0
17
10

72 66 CC 48 0D
CA 78 7C 7 D6 2C 87 72 07
FE 99 4 B A 8 7
24

B 9 C

B48727C470D07D6B8E662CAFECC87899
D6
70 8 9 4
Q.5 c) Find the line of regression of Y on X for the following data

E FE B
1/12

CC 48 D0 70 B8
87 72 66 CC 48 D
7 E6
16
11

89 7C D6 2C 87 72
7C 07 6
9B 47 B8 AF 89 D6
48 0D E6 EC 9 B4 470 B8
72 07 6 2 C 8 8 7 D E6
7C D6 C 7 2 07 62
is analytic. Also, find its derivative.

A 8 7
Paper / Subject Code: 50391 / Engineering Mathematics -III

47 B 8 F 99 C D6 CA
0D E66 E C B 47
0D B 8 F
07 48 E6
D6 2C C8
78 727 0 7D 62
B8 AF
EC 9 9 C4 6 B8
CA
E6 B4 70 FE
62 C8 87 D0 E6 CC
2 62
[8]
[6]
[6]
[8]
[6]
[6]
[8]

CA
FE
78
99 7 C 7D C
47 6B AF
CC B4
8 0D 8E EC
87 72
7C 0 7 66
2C C8
89 D6 78
9B 47 B8 A F 9
48 0D E EC
72 07 6 62 C8
7C
4
D6 C A 78