3

2
0
2

2B
0D

71
F2
02
Paper / Subject Code: 51423 / Database Management System

35
22
2D

01
C6
1T01233 - S.E.(Information Technology Engineering)(SEM-III)(Choice Base Credit Grading System )

2B
0D

71
F2
02
4D

35
22
2D

01
C6
(R- 19) (C Scheme) / 51423 - Database Management System

08

2B
0D
2
2
D
7F
QP CODE : 10039818 DATE: 28/11/2023

F
0
4

22
D

01
C6
12

08
Time: 3Hrs Marks: 80

0D
F2
02
D
E0

7 F

1
6
DE

0
C

2
1
Q1 is compulsory.

0D
2
2
4D
0

F
71

0
E

7
Attempt any three questions out of remaining five questions.

2D

01
C6
E

12

08
35

F2
02
D
E0

F
2B

D
7

6
Q1. Attempt All questions 20M

DE

12

8
35
22

2
0

02
4D
0

7F
(a) Explain role of DBA.

B
0D

E
7
2

C6
DE

08
5
(b) Explain generalization in EER.

22
01

1
3

02
D
0

7F
2B
0D

1
F2
(c) Explain concept of log-based recovery.

EE

84
57

6
12
22
2D

DC
1
(d) Explain DML commands with example.

F0
D
3
0

0
B
D

1
2

E
02

84
7
F

2
0

2
35
22
D

01
C6

0
D
Q2.

E0
2

7F
2B
0D

71
2
2
4D

F
0
(a) Explain Conflict and View Serializability in detail 10M

12
35
22
D

01
C6

D
08

0
2

F
(b) Write SQL Queries for the following. Assume data wherever required. 10M

B
D

1
2

EE
02
D

27
7F

57
F

22
10
4

Employee (Eid, Ename, Salary, Experience, Dept_name, Location)

D
6

01
12

1D
8

B3
D2
0
C

2
0

2
I. Find maximum salary of employees Dept_name wise.

EE
2
4D
E0

7
F

22
0
0
27

5
II. Change department to ‘Testing’ of employees who experience is less than 5 years.

2D

01
C6
DE

1D
08

B3
D2
1

F2
02
D
E0

III. Create view from employee table as employee_record containing first 3 columns

57
22
71

0
7

1
6
DE

12

B3
D2
of employee table.
35

0
DC

2
0

2
2
0

7F

IV. Delete all entries from employee table working in ‘production’ Department.
2B

DF

22
71

10
60
E

84
E

D2
35
2

0
C

22
1

F0
D
D2

F2
D
E0
2B

71

10
60
7

Q3
84

D
10

12
5
2

20
DC

22
F0
D
3
D2

(a) Draw EER diagram for hospital management system 10M

0

0
2B

DF
1
F2

0
E

4
7

6
10

(b) Write relational algebra queries for. Assume data wherever required.
E

8
35
2
2D

DC

22
1

F0
D
D2

I. Find names of employees whose location is ‘Mumbai’

0

10M
2B

71
F2

60
E
02

27

84
10

DE

II. Find maximum salary of employee from employee table,

5
22
2D

DC
6

01

F0
B3
0
DC

0D

1
F2

III. Find names of the employees whose Eid is greater than 3.

EE
02

27

84
57
22
84

2D

1
C6

F0
1D
B3
D2
0

0
F0

F2

E
02
4D

27
Q4.
57
22
0

E
27

2D

01
6

01
D
08

(a) Explain concept of sub queries with example 10M

D2
DC
01

2B

71
F2

EE
02
7F

(b) Draw and explain DBMS system architecture. 10M

10
EE

84

35
22
D
6
12

1D
20
DC

2
F0
1D

2B
D
02
E0

57
DF

10
27

Q5
84

22
6
E

B3
20
DC

22
01

F0
1D

0D

(a) Define Normalization. Explain 2NF in detail 10M

F

22
60
EE

27

84

D
57

01

(b) Draw and explain generalization ad specialization in detail 10M

D2
C

22
01

F0
D
B3

F2
D
71

10
0
EE

27

2D
22

C6
8

Q6. Write short note on 20M

35

20
01

F0
D
D2

02
4D
B

DF
71

(a) Binary Relational operation

EE

27
22

C6
8
35

(b) Types of attributes

22
01

F0
D
2

4D
B
0D

71

60
EE

(c) Foreign key with example

27
22

08
35

DC
01

1
D

(d) Recursive Queries

2

7F
B
0D

71
F2

EE

84
22

12
35
2D

01

F0
D
2

E0
B
0D

71
F2

27
22

E
35
D

01

01
1D
2
22

B
0D

*************
F2

EE
57
22
0

01
C6

1D
3
2
22

B
0D
F2
4D

57
22
0

01
C6
08

B3
D2
22

F2
4D

22
0
0

01
C6
08

D2
22

F2
4D
7F

39818
10
0

D
C6
12

08

20
22
4D
E0

7F

DF
0
C6
DE

12

08

22
D
E0

60
27

84
DE

DC
01

DEE0127F084DC6022DF2010D222B3571
F0
 19
75
A
67
40
Paper / Subject Code: 51422 / Data Structure & Analysis

03

77
AB
BC
B4

7E

51

19
3E

3A
40

B7
1T01233 - S.E.(Information Technology Engineering)(SEM-III)(Choice Base Credit Grading System ) (R-

C6

77
69

B4

E0

AA
0B

51
19) (C Scheme) / 51422 - Data Structure & Analysis

23

3E

7
C6
4
1F

AB
69

B4
QP CODE: 10038221 DATE: 23/11/2023

E0
B
97

23

3A
67
0
90

4
1F

69

BC
4

E0
71

EB

A
97

23

A
67
0
17

44
(3 Hours) [Marks: 80]

03
9

69

BC
75

71
1

E
7

3
AB

3E
9

7
0
17

F2
0

C6
44
N.B.: 1) Question No. 1 is compulsory.

69
75
3A

71
1

0B
7

3
2) Answer any three out of remaining questions.

AB

E
9
E0

17

2
90

93

44
1F
3) Assume suitable data if necessary.

C
75
A
67

36

EB

B
97
3

7
B
BC
4) Figures to the right indicate full marks.

40
E0

F2
90
A

93
51

4
A
7
40

71
1

B
B7
6

77

23
BC
B4

3E
09
E0

51

1F
19

69
3E

3A
67
0
Q1. (a) Explain data structures and Abstract Data Type. (5)

B7
4

97
7

23
69

C
B4

3E
E0

17
(b) What is expression tree? Give examples. (5)

90
A
B

1F
23

69
3E

5
A
7
0

71
(c) What is a Linked List? State the different types of Linked List. (5)

B7
6
44

97
1F

23
9

E0

7
6

90
(d) What are the different ways to represent Graph. (5)

AA
B
97

51

1F
23

7
0

71
90

7
93

6
44

97
1F

03

AB
C

17
71

36

EB

90
0B

E
97

5
3A
67
17

F2

71
90

B7
3

44
Q2. (a) Write an algorithm to implement queue using an array. (10)
9

C
75

E0
71

17
71

EB

AA
B
23
AB

09

75
67
0
17

44
1F

03
Q2. (b)Explain insertion sort with example by giving its algorithm and comment on its complexity.
9

AB
9

BC
75
3A

71

7E
97

23

(10)
AB

3E

3A
40
E0

17

C6
F
9

69

B4
5
3A
67

E0
71
1
B7

0B
77

23
BC

E
09

Q3. (a) Write an algorithm to implement stack using array. (10)

67
E0

AA

4
51

F
9

BC
B4
67
40

1
71

6
B7

7
03

23
BC
B4

3E
9

40
7

Q3. (b) What is Doubly Linked List? Write an algorithm to implement following operations on Doubly
90
A
7E

1F

69

B4
3E

75
3A
40

Linked List.
71
C6

23
B
69

B4

3E
9
E0

a) Insertion (all cases)

90
AA
0B

51

1F
23

69
3E

67

71

b) Traversal (Forward and Backward) (10)

7
44

97
1F

03

23
AB
69

BC

7
EB

0
7E
97

1F
23

19
5
3A
40
90

7
93

C6

Q4. (a) Define Minimum Spanning Tree. Construct a minimum spanning tree shown in figure 1 using
97
1F

77
AB
B4

0
36

Kruskal’s and Prim’s Algorithm and find out the cost with all intermediate steps.
90
0B

7E
97

(10)
3E

5
A
F2

71
90

B7
6
4

03
69

BC
B4
71

17
71

AA
7E
23

3E
09

75
40
17

C6
1F

03
19

AB
69

B4
75

0B

7E
97
77

23
AB

3E

3A
90

C6
44
51

1F

69

E0
71

EB
B7

B
97

23

67
40
17

90
AA

93
1F

BC
B4
5

71

36
B7

97
3

3E

40
E0

17

F2
90
AA

69

B4
5
67

1
71
B7

97
3

3E
E0

17

F2
0
AA

19

69
5
67

71
B7
3

77

23
BC

09
E0

AA

51

1F
19
67
40

Figure 1
B7

97
3

77
BC
4

E0
EB

90
AA

5 1
67
40

71
B7
03
BC
4

17
EB

AA
7E

75
40
93

03

AB
BC
4

38221 Page 1 of 2
36

EB

7E

3A
40
F2

93

6
BC
4

E0
71

36

EB

67
40
F2

93

BC

971F23693EB440BC67E03AAB75177190
B4
71

36
 71 EB 67 AB 90
F2 4 40 E0 75 97
36
93 BC 3 AA 17
71
1F
71 EB 23
67 B7 90 69
F2 440 E0 51 97 3E
36
93 BC 3 AA 77 1F B4
EB 19 23 40
67 B7 09 69
4 40 E0 5 71 3E BC
36
93 BC 3 AA 17
71 F2 B4 67
E0
EB 67 B7 90 36 40 3A
4 E0 5 97 93 BC

38221
each step.
40 3 17 1F EB 67 AB
BC AA 71 23 44 E0 75
B4 6 7E B7 90 69 0B 3A 17
40 03 5 97 3E C6 AB 71
17 1F B4 7E 90
BC AA 71 23 75 97
6 90 69 40 03 17 1F

c) Selection Sort
B7

e) Binary Search
7E 97 3E BC 23 AA 71
51

b) Expression Tree
03 77 1F B4 67 69 B7 90
BC AA 19 23 E0 4 5 17
97
1F
3E
67 0 0B

a) Breadth First Search

B7 69 3A B4
E0 5 1
97
1
3E C6 A 71
9
23
6 40
3A 77 F2 B4 7E B7
51
09 9 3E BC
AB 19 36 40 03 71 67
09 93 BC AA 77 F2 B4
75 1 4 E0

Q6. Write Short note on any four:

40,30,20,25,21,50,60,70,65,22,18,15

17 71
F2
EB 6 7E B 9 0
36
93 0 BC 3A
71 3 44 0 75 97 E
1 7 B 6 7
AB

d) Double Ended Queue (De-Queue)

90 69 0B 3A 1F 75
97 3E 71 23 44 E0
1F C6 AB 9 6 9 0 B 3 A 17
23 B4
40
7E
03 7 51
09
71 3 EB C AB 71
69 B A 7 F 67 90
3E C6 71 23 44 E0 75 97
AB
7
90 6 9 0 B 3 A 17
7
1F
B4 7E
5 9 7 3 C A 1 23
40 03 1 7 1 F
EB 6 7 B 90 69

Page 2 of 2
BC AA 71 23 44 E0 75 97 3E
67 90 69 0B 3A 17 1F
B7
5 9 C A 71
B4

************
E0
1 7 3E
B 6 9
23 40
3A 77 1F
23 44 7 E0
B7 09
69
3E
AB 19 6 0 3 51 71
0 9 B A 7 7 F B4

971F23693EB440BC67E03AAB75177190
75
17
97 3 E C 67 A 1 90
23 40
1F B7 69
71 23 B4
40 E 03 51 971 3 E
BC
90 69 BC AA 77 F2 B4 67
97
1F
3E 67 B7 1 90 3 69 4 0B
B4 3
23 4 E0 5 97 C6
Paper / Subject Code: 51422 / Data Structure & Analysis

69 0B 3A 17 1F EB
11. Using linear probing, insert keys 54, 26, 93, 17, 77, 60 and 31 into the table.

3E C6 7 19 23 4 4
7E
B4 7E
AB
7 09 69 0 B
03
A
40 03 51 71 3E C6
7 F2 B 7
Q5. (b) Write the algorithm for deletion of a node (all cases) in a Binary Search Tree.

BC AA 71 44 E0
67 B7 90 36
93 0 BC 3A
E0 5 97 E AB
3A 17
71
1F
23 B 44
67
E0 75
AB
75
90 6 93 0BC 3AA
97 EB
17 1F 67 B7
71 23 44 E0 51
90 69 0B 3A
(10)

77
(10)

(20)
(10)

97 3E
Q4. (b) Define AVL tree. Construct an AVL tree from the following data and mention the rotations in

Q5. (a) What is collision? List down the methods to resolve the collision. Consider a hash table of size

C6 AB 19
1F
23 B 4 7 E 7
40 03 51
69
3E B C A A
77
19
 BC

32

D
1

E5
1D

9A
Paper / Subject Code: 51421 / Enginering Mathematics III

13
17

DC
10
BC

32
33

E5
1D

9A
13
1T01233 - S.E.(Information Technology Engineering)(SEM-III)(Choice Base Credit Grading System )

46

17

DC
10
BC

32
21

33
(R- 19) (C Scheme) / 51421 - Enginering Mathematics III

9A
3
81

46

17

1
1
QP CODE : 10037856 DATE: 21-11-2023

10
AF

32
21

B
63

3
1
13

17

01
8

C1
14
AF
ED

3
(Time: 3 Hours ) Max. Marks: 80

3
12

B
3

1D

3
46
13

17
E5

1
8

0
AF

BC
21
ED

33
N.B. (1) Question No. 1 is compulsory.

1
DC

1D
1

46
13

7
E5

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

1
9A

C
21
D

3
DC

3A

B
63
E
32
(3) Use of Statistical Tables permitted.

17
5

F8

14
1
A
13

3
(4) Figures to the right indicate full marks

B
3
10

E
32

1
D

46
13

17
5

8
1D

A
3

CE

AF

21
ED

33
1

29
0
Q1. BC

81
D

46
13
1

5
1D

9A
3

21
D
17

C
(a) Find the Laplace transform of [5]

3A
10

E
C

81
AD
33

E5
B

D1
D

F
46

17
(b) Find k such that f ( z ) = log ( +i is analytic [5]

1
1

3A

2
0

E
BC

2
21

81
AD
3

33

5
3

D1
(c) Calculate the Spearman’s rank correlation coefficient R

CE
1

[5]

AF
6

17

01
F8

C1

29
14

5E
D
33

X : 10 , 12 , 18 , 18 , 15 , 40 .

13
1

33
3A

1D

9A

E
1

46

ED
7

01
Y : 12 , 18, 25 , 25 , 50 , 25 .
F8

DC
D1

31

BC

2
21

D1

33
3A

E5
3
5E

9A
(d) Find the inverse Laplace transform of log ( ).
81

[5]
6

17

01
1

DC
4
D1
CE

BC

2
21

33

33
A
E

1D

9A
81
AD

6
3

17
E5

01
14
1

Q2.
AF

BC

32
D

33

1
29

DC

12
E

1D

13
(a) A continuous random variable has probability density function
46
13

7
33

E5

F8

31
9A

10
BC
1
D
01

f(x)= k ) , 0 1.
DC

63
E

1D
32

1
3
D1

17
E5

f (x) = 0 otherwise
4
D1
9A
13

AF

BC
21

33
C1

C
10

5E

Find k , mean and variance. [6]

32

81
AD

46
13

17
7B

1D

13

AF

21
ED

33
(b) Find the Laplace transform of ∫ [6]
9

C
31

10
BC

1
D

46
13
3

E5

F8
63

1D

9A

(c) Obtain the Fourier series to represent f (x) = in (0, 2 )

3

21
ED
17

01

DC
14

3A
BC

81
33

D1

…….
33

5
12

Hence show that = - + - [8]

D1
9A

AF
46

17

01
F8

C1

5E
32
21

AD
33

13
D1
3A

7B

CE
81

46

ED

Q3.
1
C1

29
D1

0
AF

21

AD
33

E5
7B

(a) If the imaginary part of the analytic function w = u + i v = f ( z ) is [6]

1D

13
81

6
13

29

DC
14

10
AF

BC

V= + , then show that u = - 2 x y + .

ED

33

33
12

1D

9A
6
13

7
E5

01
F8

14

BC

(b) Find inverse Laplace transform of

32

[6]
ED

D1
DC

12

63

13
13

17
E5

F8

C1
14

(c) Fit a second-degree parabolic curve and estimate y when x = 10

9A

10
ED

33
C

12

7B

1D

x : 1, 2, 3, 4, 5, 6, 7, 8, 9,
AD

46
13
5

F8

1
CE

BC
1
ED

33

y : 2 , 6 , 7 , 8 , 10 , 11 , 11 , 10 , 9 . [8]
29

12
AD

46
13

17
33

F8
CE

21
ED

33
01

3A
32

Q4.
1
AD

46
1

8
1
1D

13

CE

AF

21
ED

(a) Obtain the Fourier series to represent f ( x ) = in ( - ). [6]

9
10

32

81
AD

13
5

(b) Find ( i ) the equation of the lines of Regression ( ii ) coefficient of correlation for
1D

13

CE

AF
ED
9
10

the following data

BC

32

AD

13
E5
1D

13

X: 65 , 66 , 67 , 67, 68 , 69 , 70 , 72 .
ED
7

DC
31

10
BC

32

E5

Y: 67 , 68 , 65 , 66 , 72 , 72 , 69 , 71 . [6]
3

1D

A
13
46

DC
31

10

√
BC

32

(c) Prove that ∫ dt = . [8]

3

1D

9A
13
46

7
31

10
BC

32
21

1D

13
81

46

37856 Page 1 of 2
31

10
AF

BC
21

1D
81

46
13

7
31
AF

BC
1
12

63
13

D13AF8121463317BC1D1013329ADCE5E
F8

14

31
 13 46 1D 9A D1
AF 3 31 1 01 DC 3A
81
21 7 BC 33 E5 F8
13 46 1D 29 ED 12
AF 3 AD 13 14
31 10 C 63
81
21 7 BC 13
32 E5 AF
81 31
7B
46 1D 9 ED 21
F8 3 31 10 AD 13 46 C1
D1
12 7 13 CE AF 33 01 Q5.
1 BC 32 5 81 17 33
9

.(c) If
ED

X
21 BC

37856
46

X
1D 29
3 10 AD 13 46 1D
31
7 13 CE A F8 33 10 AD
14 BC 32 5 12 17 13 CE
63 1D 9 ED
14 BC 32 5E
P X=x)

P ( X =x ) :
10 AD 13 6 1D 9A D1
A

:
31

v= 3
7 33

Hence show that

:
13 CE 10 3A
1 DC
F8 :
BC 32 5 12 7B 13 E5 F8
1D 9 ED
14 C1 32 E 1

k
AD 13 6 9A 21

1
31 10 A 33 D1 46 D1
7
-2

=
13 CE 3A
BC 32 5 F8
127B 31 01 DC
E5 33 F8
1D A 9 ED 3 2 2 E
17 1

2
1

2k
14 C1 9 D BC +
10 DC 3A 63
3
D1 AD 1 3
14
6 1D
13 E5 F8 1 7 01 C A F 3 3 10
+

32 ED 12 33 E5 17

3
BC 81

3k
1 13
3

9A 2 E D B C

Find k , p ( X < 5 ) , P ( X > 5 )

DC 13 46 1D 9A 21 32
1 D 13
hence find first four central moments .

AF 33 46 1D 9A
E5 8 17 0 1 C AF 33 1
1 3 E 0 DC
4
ED 21 BC 32 5E 81 17 1 3 E5
……..

13 46 1D 9A D1 21 BC 32
4 1 9 ED
1

AF 33
1 10 DC 3 A 6 3 D A

And find the corresponding analytic function .

81 7B 13 F8 31 10 DC 13
21 3 E5 7 B 1 3
AF
5

46 C1 29 ED 12 3 E5 81
D1 AD 13 14 C1 29 ED 21
33 01 C 6 D 1 A D 13 46
(a) Find the orthogonal trajectories of the family of curves

17 E AF 33 0

Page 2 of 2
8 C
k

BC 33 5 1 17 1 3 E AF
8
33
1D 29 ED 2 1 BC 32 5 E 1 17
AD 13 46 D 21 BC
(b) Find the moment generating function of the distribution

10 1D 9A
1 D 13
________________________
13 CE AF 33 46
01 33
(b) The probability density function of a random variable X is
6

5E 81 17 CE AF
(c) Obtain the half range cosine series of f ( x ) = x in ( 0, 2 )

32
2

33 5 8 17

D13AF8121463317BC1D1013329ADCE5E
9A D1 21 BC 2 E 12
4 1 9 D BC
DC 3A 63 D1 AD 1 14 1D
Q6.(a) Using convolution theorem Find the inverse Laplace transform of [

E5 F8 31 01 C 3A 63 1
1 7 E F 8 3
33 5
=c.

ED 17
,show that v is harmonic function

13
21
46
BC
1D 29 ED 1 21 BC
AF 33 1 AD 13 46 1D
7

C A 3
]

01 3
Paper / Subject Code: 51421 / Enginering Mathematics III

81 17 33 E5 F8 10
21 BC 1 17 13
46 1D 2 9A E D 21 B C 32
33 1 01 D 13 46 1 D
17 CE AF 33 10
BC 33
2 5 E 8 1 17
B 13
1D 9A D1 2 14 C1 32
10 DC 3A 63 D 9A
3 D
[ 6]

13 E F 1 10
[6]

[8]

1
[6]

7
[6]

[8]

32 5E 81 BC 3
9A D1 21 32
3A 46 1D 9A
DC
E5 F 3 3 1 01 DC
81 17 3
ED 21 B C 32 E5
13 46 1D 9A
AF 33 1 0 DC
81 17
B 1 3
2 3 E5
 2B
4C

CD
5

5C
16
Paper / Subject Code: 51425 / Paradigms & Computer Programming Foundation

2D
DA
F3

BB
CA
1T01233 - S.E.(Information Technology Engineering)(SEM-III)(Choice Base Credit Grading System ) (R- 19)

4C

D
65

5C

D2
BD

BC
DA
A1
(C Scheme) / 51425 - Paradigms & Computer Programming Foundation

F3

C2
8F

2B
DC

65

C
QP CODE: 10039166 DATE: 02/12/2023

A4
0C

D
A1

F3
FB

C2
CD
Time: (3 Hours)

91
(Total Marks: 80)

65
8

4
D5

BD
0C

35

DA
A 1
N.B.: 1. Question No.1 is compulsory.

C2
F
15

8F

DC

65
9

5C
CD

4
D5

0C

DA
A1
2. Answer any three out of remaining questions.

F3
FB
15
BB

91

DC

65

C
C8
CD

D5

35
3. Assume suitable data if necessary.

D2

1
FB
10

5F
15
B
C2

DC
59
2B

C8
4. Figures to the right indicate full marks.

CD

16
A4

3
FB
D

CA

F
15
BB

91
C2
CD

65
Q1. a) Explain Encapsulation and Abstraction with suitable examples from C++ or Java. (05)

C8
CD

D5

BD
2
4

A1
35

0
DA

15
BB

91

8F
b) List various characteristics of scripting languages? (05)

C2
5F

C
D

D5
C

BD
C
2
4
16

BC
5

2D

0
DA
c) Explain how infinite lists are supported in Haskell. Give suitable example. (05)
3

15

91
CA

8F
5F

DC
B
C

CD

D5
C

C
2
A4
16
BD

35

FB
d) What are different programming paradigms? (05)

2D

10
15
BB
CA

CD
F

59
8F

C8
4C

CD
5

D2
16
D

5D
0C

35

10
A
FB

BB
A

C2
D
Q2. a) Explain database manipulation commands in Prolog with an example. (10)
F

1
91

59
C

CD
5

5C
C8

D2
4
6
D5

BD

5D
A
A1

F3
b) Explain different storage allocation mechanisms. (10)
10

BB
2
D
15

D1
8F

C
DC

65
59

5C

D2
CD

A4
0C

BC
1
5D

F3
B

C2
CD
BB

2B
Q3. a) What is the role of an Exception Handler in a programming language? Briefly explain
DC
D1

5
9

C8

A4
16
D5

35
D2

2D
BC

important tasks it performs. (10)

0

CD
5F
15

F
C2

4C
DC
59
2B

C8

b) Explain lifecycle of a thread. (10)

CD

5
A4

DA
A1
5D

F3
B
2D

0
BB

91

8F
CD

DC
D1

65

5C
4C

C
D2

A1
D
C
35

F3
B
0
DA

15
BB

91

8F

Q4. a) What is logic programming? Explain Facts and Rules along with an example. (10)
C2
5F

65
D

5
5C

BD
0C
D2
A4
16

A1
D
BC

b) Discuss Call by value vs Call by reference with example code in C or C++. (10)
F3

15

91
CA

8F
C2
CD

DC
B

CD
65

0C
2
A4
BD

5D
35

FB
2D
A1

91
CD
5F

1
8F

C8
C
DC

CD

5
D2
4

Q5. a) Explain Type and Type classes in Haskell. (10)

16

5D
35

10
A
FB

BB
CA

2
CD
5F

59
C

CD

b) What is Inheritance in OOP? Explain different types of Inheritance in OPP. (10)

C8

D2
A4
16
BD

5D
35
10

B
CA

C2
CD
5F

D1
8F

2B
59

A4
16
BD
0C

BC
35

D
5D

CA

2
CD

Q6. Short note on: (Any 4) (20)

F
91

8F

2B
C
5

A4
16
D5

D
0C

35

2D
FB

a) Static Scoping vs. Dynamic Scoping

A

CD
5F
15

91

4C
DC
C8

b) Need for thread synchronization in concurrent programming

CD

16
D5

DA
F3
FB
10

CA

c) Curried Function in Haskell

15
BB

65
59

5C
C8

d) Lambda Calculus
CD

D
D2

A1
5D

F3
B
10

e) Backtracking in Logic Programming

BB

8F

C
D1

65
59

BD
C
D2

A1
5D
BC

10

8F
C2

DC
D1

59
2B

**********************
C
A4

5D
BC

FB
2D

10
CD

D1

59
2B

C8
4C

5D
BC
2D

10
DA

D1

59
2B
4C
5C

5D
BC
2D
DA
F3

D1
2B
4C
65

5C

BC
2D
DA
A1

F3

2B
4C

39166 Page 1 of 1
65

5C

2D
DA
A1

C8FBDCA165F35CDA4C2D2BBCD15D5910
F3
 D

78

BC
F

DC

AF
Paper / Subject Code: 51424 / Principle of Communication

05
7B

AB
FA

CD
1T01233 - S.E.(Information Technology Engineering)(SEM-III)(Choice Base Credit Grading System ) (R-

78
63

AF

B
05
7B
84

AD
19) (C Scheme) / 51424 - Principle of Communication

AB
CD

78
4B

63

F
QP CODE: 10039100 DATE: 30/11/2023

AF
5
7B
84
C4

0
FA

CD

78
Time:3Hours Total Marks:80

4B

3
1D

46

05
B
C4

D
66

37

CD
N.B. (1). Question No.1 is compulsory.

B
D
28

7
F
6
4

5
1

7B
4
4

D
CB

0
66

B8
DC

FA

CD
(2). Out of remaining attempt any three.

63
8
BB

4
2

7B
84
4

AD
B

C
FA

86
(3). Assume & mention suitable data wherever required.

4B

63
1D

F
B

2
8A

7B
4
4
AB

CB

66

8
DC
(4). Figures to right indicates full marks.

B
7

63
8
AF

F
B
05

4
B2

61

B
84
4
AB
CD

DC
8

37
86
BC

4B
Q.1 Solve any four [20]

57

AF

46
B2
AD

1
D0

C4
B
a). Explain need of modulation. Justify it with example.

B8
78

FA

6
BC
F

1D
DC

28
b). Define the following terms.

44
7B

A
0

AB

CB

66
i) . Noise figure ii). Noise temperature
FA

DC
78
63

DC

8
F

B
5

4
iii). Noise bandwidth iv) Noise voltage v) Modulation.
7B
84

B2

61
8A
D0

C4
AB
A
4B

c). Compare AM and FM.

63

86
BC
57
BF

1D
DC

F
84

B2
C4

d). Explain in short pre-emphasis and De-emphasis.

8A
0

B
37

66
FA

CD
4B

FA

BC
1D

e). What is PSK signal. Draw the PSK signal for the following binary signal 111010011.

57
6

28
B
84
C4

AD

A
D0
66

B
f). Explain the principle of reflection and refraction.

CB
7

78
4B

A
3
1D
28

BF

C
6

BB
5
84
C4

D
CB

8A
D0
66

37

FA
Q.2 a) Define signal to noise ratio. Explain the effect of cascade connection [10]
B

FA
1D
28

57
BB

C
6
4

on a signal to noise ratio. Derive Friss formula for two stage cascade amplifier. 7B
84
C4

D
CB

8A
0
66
A

D
B

63
b) Derive the expression for total power in AM. [10]
1D
28

57
AF

BF
BB

DC
4

4
4
CB

D0
66

B8
DC
78

37
A

FA
28

Q.3 a) The AM Transmitter develops an unmodulated power o/p of 400 Watts across a
AF

BB

DC
5

6
4
1

7B
D0

84
4
CB

66

50𝜴 resistive load. The carrier is modulated by a sinusoidal signal with a modulation
78

FA
4B

63
D
C

28
AF

BB
5

index of 0.8. Assuming fm= 5KHz and fc= 1MHz.

AD

61

7B
D0

84
C4
CB
78

86

(i) Obtain the value of carrier amplitude Vc and hence write the expression for AM
B

63
BF

1D
DC

AF

BB
5

4
B2

signal.
D0

84
C4
37

6
FA

78

86
C

4B

(ii) Find the total sideband power.

D
DC
46

AF

BB
5
7B

61
D0

C4
B8

CB

(iii) Draw the AM wave for the given modulation index. [10]
FA

78

FA
63

86

1D
C
44

b) Explain quantization process in PCM with suitable diagram. [10]

BB
05
7B
84

B2
AD

8A
DC

66
CD
B

FA
63

BC
7
BF

28
44

05

Q.4 a) What are the limitations of TRF receiver? Explain how these
4

AD

AB
B8

CB
DC

CD

78
63

limitations are avoided using super-heterodyne receiver. [10]

BF
44

AF

BB
5
1

b) Compare ground wave, sky wave, space wave and tropospheric

AD

0
66

B8
DC

CD

78

FA
63

scatter propagation..
8

[10]
BF
44
B2

5
1

AD

8A
0
66

B8

Q.5 a) Explain FDM transmitter & receiver with block diagram [10]
DC

CD
BC

63
28

57
BF
44

b) Draw the block diagram of PAM generator and detector. Explain the working
1

D
CB

D0
66

B8
DC

FA

giving waveforms at the output of each block. [10]

63
28
B

DC
44
1

7B
4
AB

CB

66

B8
DC

FA

Q6. a) Explain slope overload error and hunting error in Delta modulation. Derive the
63
28
AF

44
1

7B
4
AB

condition to avoid slope overload distortion. [10]

CB

66

B8
DC
8
57

63
28

b) Explain the generation of SSB with phase shift method. [10]

AF

44
1

84
AB

CB

66

DC
8

4B
57

28
AF

1
D0

C4
AB

CB

66
8

______________
57

1D
DC

28
AF

B
D0

AB

CB

66
A

8
57
BF

DC

28
AF

B
D0

AB

CB
A

8
57
BF

DC

AF

39100 Page 1 of 1
D0

AB
7

8
63

57
BF

DC

AF
84

D0
7

8
B

63

57
BF

DC
44

84

D0
7

FA
B

63

DC
44

61DC44B84637BFADCD0578AFABBCB286
7B
84