Y

0
5X

3Y
5X
F3
03
Paper / Subject Code: 38981 / Engineering Mathematics-IV

05

40
Y1

05
X4
F3

3Y
5X
F3
03
55
Y1

40
Y1

05
X4
30
03

5X
F3
1F

03
5
05
X4

Y1

05
X4
Y
(Time: 3 hours) Max. Marks: 80

3
3
55

3
F

03
55
0

F
1
4
30

Y1
X4
Y

0
5X

F3
1F

03

3
03
55
5
N.B. (1) Question No. 1 is compulsory.

1F
1
4
3Y

X4
3Y

30
5X
3

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

F
40

1F

03
55
40
Y1

05
(3) Use of Statistical Tables permitted.

5X

X4
3Y

30
5X
3
3
(4) Figures to the right indicate full marks

F
0
05

1F

55
40
1

05
4

Y
X
F3

3Y

30
5X
F3
−1 2 3

03
55
Y1

1F

5
0
1
5 ] find Eigen values of 𝐴3 +5A + 8I.

05
4
Q1. (a) If matrix A = [ 0 3

0
[5]

05
X4
Y
5X
3
03

Y
F3
1F

3
0 0 −2

F3
03
5
40
5
X4

Y1

05
Y

30

Y1
X4
5X
3
55

F3
1+𝑖

03
(b) Evaluate the integral∫0 (𝑥 − 𝑦 + 𝑖 𝑥 2 ) dz along the parabola 𝑦 2 = x.
0

03
55
[5]

Y1

05
4
30

1
4
5X

X4
Y

0
X
F3
1F

03

F3
03
55
05

𝑎𝑘 , 𝑘 ≥ 0.

55
Y1
X4
3Y

(c) Find the z-transform of f (k ) = [5]

0
1
4
0
3

X4
3Y

30
5X
3
F

03
5
40

F
Y1

05

1F
z = 𝑥1 + 3 𝑥2 + 3𝑥3

55
0
Y1

5
X4
(d) Maximise
5X

4
30
3
3

3Y

30
5X
F

03
55
0
05

1F
1
4

1F
𝑥1 + 2 𝑥2 + 3𝑥3 = 4

40
05
4
Y

Subject to
30
X
F3

Y
X
03

3Y
55

5X
3
1F

3
55
Y1

F
40
4
0

2 𝑥1 + 3𝑥2 + 5𝑥3 = 7

40
Y1

05
3Y

30

find all basic solutions. Which

5X
3
03

X
1F

5X
F3
1F

03
5
40
5
X4

5
3Y

30

Y1

05
X4
3Y

30

of them are basic feasible, And optimal basic feasible solutions. [5]
5X
55

F
0

F3
F

03
55
40
Y1

05
4
30

Y1

1 2 3
5X

Y1
X4
0
X
F3
1F

3
3

Q2 (a) Verify Cayley- Hamilton theorem for the matrix A where A = [2 −1 4 ]

5
40
05

03
55
0
Y1

05
3Y

Y1
X4
X
3

3 1 −1

X4
30
F3
F

03
5
40

3
55
Y1

05

1F

55
0
Y1
X4
5X

And hence find 𝐴−1 𝑎𝑛𝑑 𝐴−2 .

X4
0
3

[6]
3

3Y

30
F3
F

03
55
0
05

55
Y1
4

1F
40
1
4
30
X
F3

30
X

(b) The means of two random samples of size 9 and 7 are 196.42 and 198.82 respectively
03

3Y
55

5X
1F

3
55
Y1

F
0
4
0

40
1

5
4
Y

30
5X
3

3Y

30
5X

The sum of the squares of the deviations from the means are 26.94 and 18.73 respectively. Can
F

5X
1F
40
1

F
40
5
3Y

30

05
3Y

30
X

3Y
5X

The samples be considered to have been drawn from same population? [6]
F

5
0

F3
F
0
Y1

5
X4

40
Y1

05
X4
30

Y1
3
55

5X
3
1F

3
5
40

(c) Solve the L.P.P by using simplex method.

F

03
0
05
30

Y1

05
X4
Y
X

X4
3
03
55

F3
F

03

3 𝑥1 + 2 𝑥2
55

Maximise z =
55
Y1
X4
30

Y1
X4
0

3 𝑥1 + 2 𝑥2 ≤ 18;
30
F3

Subject to
F

3
5

03
55
0
Y1

1F
1

0 ≤ 𝑥1 ≤ 4 ;
X4
30

X4
3Y

30
03

3Y
1F

55

0 ≤ 𝑥2 ≤ 6 ;
F

55
0
X4

40
1
X4
Y

3Y

30

𝑥1 , 𝑥2 ≥ 0.
3

[8]
3

5X
1F

55
40

1F
40

05
3Y

30
5X

3Y
5X

Q3 (a) Find the Laurent’s series for

F3
F
0
5

40
1

05
4
30

Y1
3Y
5X

4𝑧+3
5X
F3
1F

F (z) = (𝑧−3) valid for 2 < |𝑧| < 3. [6]

03
40
05

𝑧 ( 𝑧+2)
1

05
3Y

X4
3Y
5X
3

F3
F

55
40
Y1

05

1
3Y

30
5X
F3
03

1F
40
Y1

05
4
5X

3Y
5X
F3
03

54587 Page 1 of 3
05

40
Y1

05
X4
F3

5X
F3
03
55

Y1

05
X4
30

F3

X403Y1F3055X403Y1F3055X403Y1F3055X403Y1F3055
1F

03
55
 Y

0
5X

3Y
5X
F3
03
Paper / Subject Code: 38981 / Engineering Mathematics-IV

05

40
Y1

05
X4
F3

3Y
5X
F3
03
55
Y1

40
Y1

05
X4
30
03

5X
F3
1F

03
5
05
X4

Y1

05
X4
Y

3
3
55

3
F

03
55
0

F
1
4
30

Y1
(b) Using the method of Lagrange’s multiplier solve the N.L.P.

X4
Y

0
5X

F3
1F

03

3
03
55
5

1F
1
4
3Y

0
z = 12 𝑥1 + 8 𝑥2 + 6𝑥3 − 𝑥12 - 𝑥22 - 𝑥32 − 23.

X4
3Y

30
5X
Optimise

Y
F
40

1F

03
55
40
Y1

05
5X
𝑥1 + 𝑥2 + 𝑥3 = 10. 𝑥1 , 𝑥2 , 𝑥3 ≥ 0.

X4
3Y

30
5X
Subject to [6]

3
3

F
0
05

1F

55
40
1

05
4

Y
X
F3

3Y

30
5X
F3
03
55
Y1

1F

5
0
1

05
4
0

05
X4
Y
5X
3
(c) Marks obtained by students in an examination follow normal distribution. If 30 %
03

Y
F3
1F

F3
03
5
40
5
X4

Y1

05
Y

30

Y1
X4
Of the students got below 35 marks and 10 % got above 60 marks. Find the mean and standard

5X
3
55

F3
F

03
0

03
55
Y1

05
4
deviation. [8]
30

1
4
5X

X4
Y

0
X
F3
1F

03

F3
03
55
05

55
Y1
X4
3Y

0
1
4
0
3

X4
3Y

30
5X
3
F

03
5
40

F
Y1

05

3 10 5

1F

55
0
Y1

5
X4
5X

4
30
3

Q4 (a) Find the Eigen values and Eigen vectors of matrix A =[−2 −3 −4]
3

3Y

30
5X
[6]
F

03
55
0
05

1F
1
4

1F
3 5 7

40
05
4
Y

30
X
F3

Y
X
03

3Y
55

5X
3
1F

3
55
Y1

F
3𝑧 2 −18 𝑧+26

40
4
0

3 < |𝑧| < 4.

40
Y1

05
3Y

(b) Find inverse z- transform of F (z) = (𝑧−2) ( 𝑧−3) ( 𝑧−4 ) [6]

30
5X
3
03

X
1F

5X
F3
1F

03
5
40
5
X4

5
3Y

30

Y1

05
X4
(c ) Using the Kuhn –Tucker conditions solve the N.L.P.P
3Y

30
5X

[8]
55

F
0

F3
F

03
55
40
Y1

05
4
30

Y1
5X

z = 12 𝑥1 𝑥2 + 2 𝑥12 - 7 𝑥22

Y1
X4
0
X
F3

Maximise
1F

3
3
5
40
05

03
55
0
Y1

2 𝑥1 + 5𝑥2 ≤ 98 ;
05
3Y

Subject to
Y1
X4
X
3

X4
30
F3
F

03
5
40

3
55
Y1

05

1F

55
0
Y1
X4
5X

X4

𝑥1 , 𝑥2 ≥ 0.
0
3
3

3Y

30
F3
F

03
55
0
05

55
Y1
4

1F
40
1
4
30
X
F3

30
X
03

3Y
55

5X
1F

3
55
Y1

F
0
4
0

40

−9 4 4
1

5
4
Y

30
5X
3

3Y

30
5X
F

5X

Q5 (a) Show that the matrix A =[ −8 3 4 ] is diagonalisable. Find the diagonal

1F
40
1

F
40
5
3Y

30

05
3Y

−16 8 7
30
X

3Y
5X
F

5
0

F3
F
0
Y1

5
X4

40
Y1

05
X4
30

form D and the Diagonal zing matrix M. [6]

Y1
3
55

5X
3
1F

3
5
40

03
0
05
30

Y1

05
X4
Y
X

(b) Find the relative maximum or minimum of the function

X4
3
03
55

F3
F

03
55

55
Y1
X4
30

z = 𝑥12 + 𝑥22 + 𝑥32 - 4𝑥1 - 8𝑥2 - 12𝑥3 + 100.

Y1
X4
0

[6]
30
F3
F

3
5

03
55
0
Y1

1F
1
X4
30

2𝑧−1
X4
3Y

30

(c) Evaluate ∮ (2 𝑧+1) dz using Cauchy’s residue theorem, where C is the

03

3Y
1F

55

𝑧 (𝑧+2)
F

55
0
X4

40
1
X4
Y

3Y

30
3

circle |𝑧| = 1.
3

5X

[8]
1F

55
40

1F
40

05
3Y

30
5X

3Y
5X

F3
F
0
5

40
1

05
4
30

Y1
3Y
5X

5X
F3
1F

03
40
05

05
3Y

X4
3Y
5X
3

F3
F

55
40
Y1

05

1
3Y

30
5X
F3
03

1F
40
Y1

05
4
5X

3Y
5X
F3
03

54587 Page 2 of 3
05

40
Y1

05
X4
F3

5X
F3
03
55

Y1

05
X4
30

F3

X403Y1F3055X403Y1F3055X403Y1F3055X403Y1F3055
1F

03
55
 F3 3Y X4 30 Y1
05 1F 03 55 F3
5X 30 Y1 X4 05
1F 4 03 5 5X F 0 3Y 5X
30 1 40
30
55
Y1
F
40
3
55
X F 3 3Y
X4 305 Y 40 0 55 1F
03 1F 3 X 30
5X
4
30
5
Y1 4 0 55
55
Y1
F3 0 3Y 5 X4 F 30 3 Y1 X4
X4 05 1F 03 5 5X F 3
03

54587
03 3 Y Y1
Y1
5X
40 0 55 1F 4 03
05
5X F3
F3 3Y X4 30
5
Y1 4 0
05
05 1 F 0 3 5 X F 3 3Y 5X
40
03 5X 05 1F

Subject to
30 Y1 40 5 3Y
Y1 40 55 F 3 X 3 0

Minimise
F3 3Y X4 305 Y 1F 40 55 1F
05 1 F3 0 3Y 5 30 3 Y1 X 4
30
5X 05 1
X4
0 55 F 0 3
55
X4
40 30

z=
5X F3 3Y X4 Y1
F3 3Y 0 1F 03 5 5X F 3
03
05
5X 1 F3
40
3Y
55
X4 30 Y1 4 05 Y1
F3
05 1 0 55 03 5X
40 F 3 X F3 Y 1 40
05
3Y 5X 30 Y1 4 05 F 3 3 Y
5X
1F 40 55 F 30
03 5X 05 1F 40

𝑥1 , 𝑥2 ≥ 0.
3Y Y1 40

4 𝑥1 + 3 𝑥2
30 X4 5 5 3 3Y

3 𝑥1 + 𝑥2
55 1F 03 5X F3 3Y X4 0 55
2 𝑥1 + 𝑥2 1F
X4 30 Y1 4 0
05
5 1F 03 X 30
F 3

≥
X 4

𝑥1 + 2 𝑥2 ≤ 3;
55 30
≥
03 3 Y Y1 0 55
Y1 X4 05 1 F3
40
3Y
55 F 30 3 Y1 X4
6;
F3 03 5X 0
X4 3;
5 F 03
05 Y1 40 55 1F 03 5X 30 Y1
4
(c) Use the dual simplex method to solve the L.P.P.

5X F3 3Y X4 30 Y1 03 5 5X F3
40 05 1 F 0 3
55
X F3 Y 4 05

Page 3 of 3
5X 4 05 1 0
( b ) Find z – transform of [ 2𝑘 cos ( 3k + 2 ) ] , k ≥ 0 .

3Y 40
30
55
Y1
F 03 5X F 3 3Y
5X
1F 3Y X4 30 Y1 40 05 1F
30 1 0 5 5 F 3 3Y
5X 30
55
X4 F 30 3 Y1 X 40 0 55 1 403 55
5 F 3 3 Y X F3 Y 1
X4

********************
03 5X 0 4 05 F 03
Y1 40 55 1F
30
03
Y1
5X 3 05 Y
F3 3Y X4 5 40 5

X403Y1F3055X403Y1F3055X403Y1F3055X403Y1F3055
05 F3 3Y
The same during 10 months period. Test at 5 % level of significance.

1F 03 5X X4
1
Q6 (a) The number of car accidents in a metropolitan city was found to be

5X 30 Y1 4 05 F3 03
20, 17, 12, 6, 7, 15, 8, 5, 16 and 14 per month respectively. Use 𝜒 2 - test

40 55 F 3
03
Y
5X 0 Y1
3Y 1 40 55
Paper / Subject Code: 38981 / Engineering Mathematics-IV

X4 05 F3
1F 03 5X F3 3Y X4 0
4 05
To check whether these frequencies are in agreement with that occurrence was

30 Y1 0 5 1F 03
55 F3 3Y X4 30 Y1
X4
03
05
5X 1 F3 0 3Y
55
X4 F3
05
Y1 40 0 55 1F 03 5X
F3 3Y 30 Y1
[6]
[6]

[8]

X4 55
05 1F 03 F3
5X 30 Y 1F
X4
03
05
5X
40 55 30 Y1
3Y X4 40
1F 03 55
X4 F 3 3Y
30 Y1 05
55 03 5X
X4 F3
05 Y 1F 40
0 5 3 3Y
 Y6

X4
X4

2
2

AD
AD
Paper / Subject Code: 38982 / Analysis of Algorithm

03

32
32

Y6
Y6

X4

D2
D2

X
03
03

32
32

6A
6A

X4
X4

D2
D2

Y
Y
Time: 3 hours Max. Marks: 80

03
03

2
32

6A
A

3
6

4
X4

D2
D2

3Y
3Y

2X
N.B. (1) Question one is Compulsory.

A
6A

40
0

3
3
(2) Attempt any 3 questions out of the remaining.

6
4

2
D2

Y
3Y
3Y

2X
2X

D
(3) Assume suitable data if required.

03
A
A

40
40

23
23

6
6

X4
3Y
3Y

2X
2X

AD
AD

32
Q. 1

0
0

3
23

6
Y6

4
4

D2
2

3Y
a) Explain asymptotic notations. (05)

2X
2X

D
AD

6A
A
b) Explain job sequencing with deadline with an example. (05)

40
0

23
3

6
Y6

4
2

Y
3Y

2X
2X
c) Write the algorithm and derive the complexity of binary search algorithm. (05)

AD
D
AD

03
03

A
40
d) Definition of P, NP, NP-Hard, NP-Complete. (05)

3
3

Y6
6
6

X4
X4

D2
2

3Y
Y

X
D

03
03

32
32
32

6A
A

40
6

X4
4

D2
D2
D2

3Y
3Y
Q. 2

2X
2X

2
6A
A
6A

a) Explain 15-puzzle problem using branch and bound strategy. (10)

40
0

23
23
3

6
4
2

3Y
3Y
3Y

2X
2X
X
b) Give the pseudo code for the KMP String Matching Algorithm. Use KMP algorithm to (10)

AD
D
D

32

6A
A

find pattern=”ababada” in text=”badbabababadaab”. Show the prefix table and the valid shifts.

0
40
40

23
3

Y6
6

X4
D2
2

Y
3Y

2X
2X

AD
AD

03
03

32
6A
40

Q. 3
23
23

Y6
6

X4
X4

D2
3Y
3Y
X

AD
AD

a) Write algorithm for quick sort. Derive its time complexity. (10)

03
2
32
32

6A
40
b) Write Kruskal’s algorithm for finding a minimum spanning tree. Explain its working with
40

3
6
Y6

X4
D2
D2
2

3Y
Y

2X
2X
D

an example. Also compute the time complexity for the same. (10)
03
03

32
A
6A
A

0
23
3

Y6
Y6

X4
4
X4

D2
D2

3Y
X

AD

Q. 4

03
03

2
32
32

6A
6A

40

3
Y6

X4
X4

D2
D2
D2

3Y
Y

2X

a) Write algorithm for greedy knapsack and obtain the solution to following fractional (10)
3
03

32
32

A
6A
6A

40
0
23

greedy knapsack problem where n=5, m=100, (p1, p2....p5) = (10,20,30,40,50) and
6
X4
4

D2
D2

3Y
3Y
3Y

2X
2X

AD

(w1,w2,.....,w5) = (20,30,66,40,60)
2

6A
A

40
0
40

23
3
23

b) Find Longest Common Subsequence for the following string (10)

6
6

X4

D2

3Y
Y
3Y

X
2X

AD
AD

X=xyzytxy and Y=ytzxyx

03

32
2

0
40

23
23

Y6
6
Y6

4
X4

D2
3Y

2X
2X

AD
AD

Q. 5
03
3

A
40
0

23
3
23

6
6

X4
X4

D2

3Y
3Y

D
AD

a) Find minimum cost path from 1 to 9 for following multistage graph using dynamic
32
32
32

6A
A

0
40

programming. (10)
Y6
6

D2
2
D2

Y
3Y

2X
X

AD

03
3
32

6A
A

40
40

23
6
6

X4
D2

3Y
3Y
3Y

2X
2X

32
A
A

40
0
40

23

6
Y6

D2
Y

2X
2X
2X

03
3

6A
A
0

23
3
3

Y6

4
4

D2
2

3Y
X
2X

AD
D

03

32
6A
A

40
23

Y6
6

X4

D2
3Y
3Y

2X
D

b) Explain 8-Queen problem using backtracking. (10)

03
32

6A
A

40

23
6

X4
D2

3Y
3Y

2X

AD

Q. 6
32
A

0
0

23

6
6

X4

a) Write the algorithm for insertion sort. Also sort the following numbers using (10)
4

D2
Y
3Y
2X

AD

03

same algorithm 11,7,17,3,9,29,85,9 and show output after every pass.

32

6A
40
23

Y6

X4
D2

b) Write the algorithm for 0/1 knapsack using dynamic programming. Also solve the (10)
3Y
2X
AD

03

32

following instance where M=21, n=4, (p1, p2, p3, p4) =(2,5,8,1), (w1,w2,w3,w4)=(10,15,6,9)
6A

40
23

X4

D2

___________________________
3Y

2X
AD

32

A
40

23
Y6
6

2
3Y

2X

AD
AD

03
40

23

Y6
Y6

X4

54874 Page 1 of 1
2X

AD

03
03

32
Y6

X4
X4

D2
03

32

X403Y6AD232X403Y6AD232X403Y6AD232X403Y6AD232
32

6A
 C9

X
3Y
C9

BX

AB
Paper / Subject Code: 38983 / Database Management System

67
40
67

9A

C9
3Y
BX
3Y

7C

B
67
40

9A
40

9A
Y6

3Y
BX
BX

C
7C
03

67
40
A
9A
[Time: 3 Hours] [ Marks: 80]

Y6
4

3Y
9

BX
BX

7C
7C

0
40

9A
9A

4
Y6
Y6
N.B. : (1) Question No 1 is Compulsory.

BX
X

7C

03
7C

03
B
03
(2) Attempt any three questions out of the remaining five.

A
A

X4
6
4
Y6
X4

C9
3Y
(3) All questions carry equal marks.

BX
7C

AB
03
AB

67
0
(4) Assume suitable data, if required and state it clearly.

9A

4
6
X4

C9
3Y
BX
Y
C9

C
3
AB

7
40
67
40
67

9A

Y 6
1 Attempt any FOUR [20]

BX
Y
9

BX
3Y

C
7C

03
C

03

67
67

A
40

A
a Compare File Processing System with Database Management system

X4
05

6
4

3Y
C9
3Y
9

BX
3Y
BX

7C

AB

40
7
b T1 T2 05

0
0

6
9A

4
Y6
4

C9

BX
3Y
C9

X
BX

read(A)
7C

B
3

67
A := A − 50

0
67

A
0

A
A

4
X4
Y6

C9

X
3Y
9

BX
Y
9

read(A)

7C

AB
7C

03
AB
03

7
0
temp := A ∗ 0.1

Y6
X4
6
4
Y6
X4

C9
C9
3Y
C9

BX
A := A − temp

03
B
03
AB

67
7
40
7

A
A

write(A)

X4
6
6
X4

3Y
C9
Y
9

X
Y
C9

read(B)
7C

AB
03
AB
03
B

40
7
67

6
A

4
write(A)
Y6
4

C9

BX
3Y
9

BX
9

BX
3Y

7C
C

read(B)
3

67
0

9A
40
67

A
40

X4
6

B := B + 50

3Y
C9
Y
9

BX
3Y
BX

7C
7C

B
03

write(B)

40
67

9A
0

Y6
A
9A

4
6
4

commit

BX
Y
9

X
3Y
BX

7C

03
7C

3
7C

B := B + temp
40

A
0

X4
6
9A

6
X4
Y6

write(B)
C9
3Y
9

BX
Y

AB
7C

03
AB
03

commit
7
0
67

6
X4
4
Y6
X4

C9
3Y
9

Draw the precedence graph for above schedule?

3Y
C9

BX

7C

AB
03
AB

67
40
40
7

c Define with an example different type of Entities in ER diagram 05

6
X4

3Y
9

BX
Y
C9

BX
3Y
C9

C
03
AB

40
67

d Define Triggers. Write syntax and example of trigger. 05

7

A
0

4
Y6
4

C9

BX
3Y
9

X
C9

BX

7C

e Explain five aggregate functions of SQL with example? 05

B
3

7
40

9A
40
67

Y6
A

C9

BX
Y
9

BX
3Y

7C
03
7C

03

67

9A
40

Y6
A

X4
X4
Y6

2 a Design an EER diagram for Hospital Management System. And map it into [10]
3Y
C9
BX

7C

03
AB
B
03

0
7

relational model. Assume Suitable data.

A

X4
6
4
6
X4

C9
Y
9

BX
Y

7C

AB
03
03
AB

b Brief overall database architecture with suitable diagram. [10]

67
A

X4
6
4

C9
3Y
9
3Y
C9

BX

7C

AB

67
40
40
7

9A

Y6
Y6

3Y
C9

BX

3 a Consider the following employee database. [10]

BX
7C

03

40
7

9A
A

Employee (empname, street, city, date_of_joining)

6
4
Y6

BX
3Y
C9

BX

7C
03

Works (empname, company_name,salary)

40
7

9A
A

Y6
6
X4

C9

BX
3Y

7C
03

Company (company_name, city)

AB

67
40

9A

Y6
X4
3Y
C9

BX

Manages (empname, manager_name)

7C

03
B
40

A
9A

X4
Y6

Write the SQL queries for each of the statements given below
C9
BX
7C

AB
03

67
A

X4
Y6

C9
3Y
C9

AB
03

54735 Page 1 of 2
67
40
67
X4

3Y
C9

BX
3Y

40
67
40

9A

BX
3Y
BX

X403Y67C9ABX403Y67C9ABX403Y67C9ABX403Y67C9AB
7C
 C9

X
3Y
C9

BX

AB
Paper / Subject Code: 38983 / Database Management System

67
40
67

9A

C9
3Y
BX
3Y

7C

B
67
40

9A
40

9A
Y6

3Y
BX
BX

C
7C
03

67
40
A
a) Modify the database so that ‘John’ now lives in ‘Mumbai’.

9A

Y6
4

3Y
9

BX
BX

7C
7C

0
b) Find all employees who joined in the month of October.

40

9A
9A

4
Y6
Y6

BX
X

7C
c) Give all employees of ‘ABC Corporation’ a 10% raise.

03
7C

03
B
03

A
A

X4
6
4
Y6
X4

C9
3Y
9

BX
d) Find all employees in the database who live in the same cities

7C

AB
03
AB

67
0
9A

4
6
X4
as the companies for which they work

C9
3Y
BX
Y
C9

C
3
AB

7
40
67
40
67

9A
e) Find all employees who earn more than average salary of all

Y 6
BX
Y
9

BX
3Y

C
7C

03
C

03

67
employees of their company

67

A
40

X4
6
4

3Y
C9
3Y
9

BX
3Y
BX

b Explain following relational algebra operators with example [10]

7C

AB

40
7
0
0

6
9A

a) Selection operator b) Union operator

4
Y6
4

C9

BX
3Y
C9

X
BX

c) Rename operator d) Cartesian product

7C

B
3

67
0
67

A
0

A
A

4
X4
Y6

C9

X
3Y
9

BX
Y
9

7C

AB
7C

03
AB
03

7
0
A

Y6
X4
6
4
Y6

4 a Explain concurrency control and explain time Stamp based protocol of concurrency [10]
X4

C9
C9
3Y
C9

BX

03
B
03
AB

67
7
control.

40
7

A
A

X4
6
6
X4

3Y
C9
Y
9

X
Y
C9

7C

b Why there is need of normalization? Explain 1NF,2NF,3NF and BCNF with

AB
[10]

03
AB
03
B

40
7
67

6
A

4
Y6
4

C9

BX
3Y
9

BX
9

BX

examples.
3Y

7C
C

67
0

9A
40
67

A
40

X4
6

3Y
C9
Y
9

BX
3Y
BX

7C
7C

B
03

40
67

9A
0

5 a Describe ACID properties with examples and explain state transition diagram of [10]

Y6
A
9A

4
6
4

BX
Y
9

X
3Y
BX

7C

03
7C

3
7C

transaction.
40

A
0

X4
6
9A

6
X4
Y6

C9
3Y
9

BX
Y

b What is Deadlock. Explain wait-die and wound-wait methods with suitable [10]
C

AB
7C

03
AB
03

7
0
67

6
X4
4
Y6
X4

C9
3Y

example.
9
3Y
C9

BX

7C

AB
03
AB

67
40
40
7

6
6
X4

3Y
9

BX
Y
C9

BX
3Y
C9

C
03
AB

40
67

6 Attempt any two

7

A
0

4
Y6
4

C9

BX
3Y
9

X
C9

BX

7C

a Explain in detail with example of conflict and view serializability . [10]

B
3

7
40

9A
40
67

Y6
A

C9

BX
Y
9

BX
3Y

b Explain following Integrity constraints: [10]

7C
03
7C

03

67

a) Key Constraints.
9A
40

Y6
A

X4
X4
Y6

3Y
C9
BX

b) Domain Constraints (Null & Default Constraints).

7C

03
AB
B
03

0
7

c) Referential Constraints.
A

X4
6
4
6
X4

C9
Y
9

BX
Y

d) Check Constraints.
7C

AB
03
03
AB

67
A

c Write short note on Log based recovery mechanism [10]

X4
6
4

C9
3Y
9
3Y
C9

BX

7C

AB

______________________
67
40
40
7

9A

Y6
Y6

3Y
C9

BX
BX
7C

03

40
7

9A
A

6
4
Y6

BX
3Y
C9

BX

7C
03

40
7

9A
A

Y6
6
X4

C9

BX
3Y

7C
03
AB

67
40

9A

Y6
X4
3Y
C9

BX

7C

03
B
40

A
9A

X4
Y6

C9
BX
7C

AB
03

67
A

X4
Y6

C9
3Y
C9

AB
03

54735 Page 2 of 2
67
40
67
X4

3Y
C9

BX
3Y

40
67
40

9A

BX
3Y
BX

X403Y67C9ABX403Y67C9ABX403Y67C9ABX403Y67C9AB
7C
 X

F5
5

7
03
E7
DF
Paper / Subject Code: 38984 / Operating System

AE
YD
X4
5A
3Y

F5
03
E7
DF

AE
YD
40

X4
5A
3Y
7X

F5
03
E7
DF

YD
40
AE

X4
5A
3Y
7X

03
F5

E7
F
Duration: 3hrs [Max Marks: 80]

0
E

YD

X4
YD

5A
A

7X

3
F5

E7
3

DF
03

40
N.B.: (1) Question No 1 is Compulsory.

0
E
YD

X4

A
X4

5A

7X
Y
(2) Attempt any three questions out of the remaining five.

F5
03
E7
03
E7

DF

AE
YD
(3) All questions carry equal marks.

X4
X4

A
5A

3Y

F5
5
(4) Assume suitable data, if required and state it clearly.

03
E7
E7

F
DF

YD
40

X4
5A
5A

3Y
7X
3Y

03
E7

DF
1 Attempt any FOUR (Draw neat diagrams if applicable) [20]

F
F

0
AE

YD
40

4
D

X4

3Y
7X
3Y
a Differentiate between a Process and a Thread.
7X

F5
F5

03
E7

40
AE
YD
40
AE

YD

4
5A
b Explain the CPU Scheduling Criteria

7X
7X
7X

F5
03
F5

03

DF

AE
E

YD
What is External Fragmentation in Memory Management System? Explain with
AE

X4
YD

X4

A
3Y

F5
an example.

E7
3
F5

7
E7

F
03

40
AE

D
40

YD
d Explain Disk Organization within the OS.

5A
YD
X4

3Y
5A

7X
7X

F5

DF
03
3
E7

40
DF

e Explain the Critical Section problem.

AE
AE

YD
0

X4
4

3Y
7X
5A

3Y
7X

F5
F5

3
E7

40
AE
0
DF

YD
40
E

YD

4
5A

7X
A

7X
2 a Suppose the following disk request sequence for a disk with 200 tracks is given [10]
7X

F5
3Y

3
5

03

DF

AE
40
DF

as:
AE

D
AE
40

X4

3Y
7X
3Y

100, 150, 20, 180, 30, 70, 190, 50, 120.

F5
Y
X

F5
F5

E7
3
E7

40
E

YD
40

Assume that initial head position of the R/W head is on track 80. Count the
YD
40

YD

5A
5A

7X
5A

7X

difference in the distance that will be traversed by the head when SSTF
X

03
03

F
3
E7

DF

AE
DF

AE

algorithm is used as compared to the SCAN algorithm, assuming that SCAN

YD
0

X4
X4
4
5A

3Y
X

F5
moves towards 200 when it starts the execution.
3Y

F5

E7
3
E7
E7

40
DF

YD
40

b Explain different File Organization Methods. [10]

YD
40

5A
5A
A

7X
7X
3Y
X

03
5

DF
03

DF
E7

DF

AE
E
40

X4
X4

3Y
5A

3Y
5A

3Y
7X

F5

3 a What is a process? Draw and Explain Process State Transition Diagram with six [10]
7
E7

40
F

E
40

YD
40
AE

states.
YD

5A
5A

7X
7X
7X

b Calculate the Hit and Miss Ratio for the following string using LRU [10]
03
F5

DF
03

DF

AE
AE

technique. Compare the results for frame size 3 and 4 in terms of “number of
AE

X4
D

3Y
3Y
7X

F5
3Y

hits”
F5
F5

E7

40

YD
0
AE

YD
0

YD

Page String : 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 7, 2, 0, 7, 5, 0, 7, 5
X4

5A
X4

7X

03
F5

03
E7

DF
03

AE

X4
D

X4
X4

3Y
3Y

4 a Explain ULT and KLT. Explain the differences between the two. [10]
F5
F5

E7
E7
7

40

YD
0
AE

5A
X4

b What is a Deadlock? Explain various Deadlock Prevention Techniques. [10]

5A

7X
3Y

03
F5

DF
E7

AE
0

YD

X4
YD

X4

3Y
5A

F5

E7
03
E7

5 a Explain the three types of schedulers with a proper diagram illustrating [10]
40
F

YD
YD

5A
5A

connection within them.

7X
X

03
E7

DF
03

b What is Producer-consumer Problem? Provide the solution to the problem using [10]
F

AE
YD

X4
X4

5A

Semaphores.
3Y

F5
7
03
7

40
AE

YD
AE

YD
X4

7X
F5

03
03
7

AE
AE

YD

X4
X4

F5
5

E7
03
7
DF

AE

YD
X4

5A
Y

54552 Page 1 of 2
5

03
7

DF
03

DF

AE

X4
X4

3Y
3Y

E7
DF

40
40

5A

7X

X403YDF5AE7X403YDF5AE7X403YDF5AE7X403YDF5AE7
3Y
7X
 X4 AE YD X4 5A
03
Y 7 F5 0 3Y E7
DF X4
03 AE D X 40
7X
40 5AE YD 7 X4 F5 3Y
AE
3Y 7X4 F5A 03 7X DF
DF 03 E7
YD 40 5A
5 AE YD X4 F5 3Y E7
X
0 AE
3Y 7 F 3Y DF 40
6 a
X4 5A 7X 5A 3Y
DF D 40

54552
5 03 E7 DF F5 E7
AE YD X4 5A AE 3Y X
7 DF F 40 0
5A 3Y 7X 5 3 E7 i.

v.
X4
D A Y ii.

iv.
4
iii.

an OS.
03 E7 03 E7 DF X4
5A X F5 03
E7
YD 4 A YD X 4 5 A YD
X4 F5
AE
03
YD
E7
X4 F 5A 0 3 E7X F5
YD 4
03 7 F 0 E 0 AE
YD 5A 3Y 7X F5 3
Aging

X4 AE YD 7X
7X F5 03 E7 DF 40 40
5A 3Y 7X F5
Thrashing
Starvation

40 AE YD X4 3Y
3Y 7X F5 03 E7 DF 40 AE DF
YD 5A 3Y 7X
Convoy Effect

DF 40 AE X4 5A
Context Switch

5A 3Y 7X F5 03 E7 DF 40 E7
DF 40 AE YD X4 5A 3Y
E7
X4 5A 3Y 7X F5 03 E7 D F
X4
03
03 E7 DF 40 AE YD X4 5A YD
Explain the following terms in brief

YD X4 5A 3Y 7X F5 03 E7 F5
F5 03 E7 DF 40 AE YD X4 AE
AE YD X4 5A 3Y 7X F5 03 7X
7X F5 03 E7 DF 40 AE YD 40
40 AE YD X4 5A 3Y 7X F5 3Y
3Y 7X F5 03 E7 DF 40 A E DF

Page 2 of 2
DF 40 AE YD X4 5A 3Y 7X 5
5A 3Y 7X F5 03 E7 DF 40
_______________________

E7 DF 40 AE YD X4 5A 3Y
X4 5A 3 7X F 5 0 3Y E 7X DF
03 E
YD 4 0 A E D 4 5A
7 F 3 F 0 E7
YD X4
03
5A
E
YD 7X
4 5A 3Y X
F5 7X F5 03 E7 DF
AE YD 5A
Paper / Subject Code: 38984 / Operating System

40 AE YD X4
3 7 F 0

X403YDF5AE7X403YDF5AE7X403YDF5AE7X403YDF5AE7
7X F5 3 E7
40 AE YD X4 5A YD X4
3Y 7X F5 03 E7 F 03
DF 40 AE YD X4 5A
5A 3Y 7X F5 03 E7
E7 D 40 A Y X4
X4 F5 3 E7 DF
5A 03
b With the help of a diagram and an example, explain how a System Call works in

AE YD X4 YD
03 7X F5 03 E7
YD AE YD X4 F5
F5 40
3Y 7X F5 03
[10]
[10]

AE D 4 03 A E7
YD
7X F5 F5
40 AE YD X4 AE
3Y 7X F5 03 7
DF 40 AE YD
5A 3Y 7X F5
E7 DF 40 AE
3
 YF

X4
X4

5
D5

9D
Paper / Subject Code: 38985 / Microprocessor

03

1B
1B
F9

YF
X4

D5
D5
3Y

X
03

1B
1B

F9
F9
40

X4

D5
D5

Y
3Y
BX

03
B

9
9
40

1
51

F
F

X4
D5

3Y
3Y
BX
Duration: 3hrs Max Marks:80

9D

B
F9

0
0

1
51
YF

4
4

D5

Y
3Y

BX
BX
9D
Q.1 (a) Design 8086 microprocessor-based on following Specifications: 10

03
03

F9
0

51
1
1. MP 8086 working at 10MHz minimum mode.

YF

4
X4
X4

D5

3Y

BX
9D
2. 32 KB ROM using 8 KB Devices

03

B
1B

F9

1
1

F
3. 16 KB RAM using 4KB chips

4
X4

5
D5
D5

3Y
Y

9D
3

B
B
(b) Draw and explain Write operation and Read operation Timing diagram of 10

9
F9

0
0

1
1

F
F

X4
4
8086 Processor in Maximum mode.

5
D5

Y
3Y
3Y

BX

9D
9D

3
1B
F9

40
0
40

F
F
X4

D5
5

3Y
3Y
3Y

X
BX

Q.2 (a) Explain the Initialization command words (ICWs) and Operational command 10

1B
B

F9
9

40
40
words(OCWs) of the 8259 PIC.
0

51
51

F
4

D5
3Y
3Y

BX
BX
BX

9D
9D

(b) Explain the interrupt structure of the 8086 processor(IVT) and differentiate 10

9
40
0

51
1
1

YF
F
YF

between Hardware and Software interrupts 4

5
5

BX
BX
X

D
9D
9D

03
03
03

F9

51
1
1

F
YF

X4
X4
4

D5
5

Y
3Y
Q.3 (a) Comparison 80386 ,Pentium 1 ,Pentium 2 and Pentium 3 Processor 10
BX

9D
9D

03
03

1B
B

F9
40
1
51

YF
F

X4
4

D5
D5

3Y
Y

BX
BX
9D

(b) Write an assembly language program for searching a Character in a Given 10

03
03

B
F9
F9

40

51
51
1

String.(Consider your own String) and Explain the following instructions:

YF

X4
4
D5

3Y
3Y

BX
BX

9D
9D

XLAT, DAA,LAHF,AAA related to 8086.

03

1B
F9

0
40

1
1

YF
YF

X4
X4

D5
D5
5
3Y

BX
9D

03
03

B
1B

Q.4 (a) Draw and explain Pentium 4: Net burst microarchitecture. 10

F9
F9
40

1
51
F

X4
X4

D5
D5

3Y
3Y
Y
BX

9D
03

1B
1B

F9
F9

40
40

(b) Explain MESI Protocol 10

51

F
X4

D5
D5

3Y
Y
3Y

BX
BX
9D

03
1B

F9
F9

0
40

51
51
YF

X4
4
D5

3Y
3Y
X
BX

9D
9D
03

Q.5 (a) Draw and explain architecture of 8086. 10

1B
1B
F9

0
40
51

YF
YF

4
X4

D5
5
3Y

X
BX
9D
9D

03
03

B
1B

F9

(b) Differentiate between real Mode , Virtual Mode and Protected Mode of 10
40

1
51
F

X4
X4

5
D5

3Y
3Y
X

80386 Processor .Explain the Floating point Pipeline of Pentium Processor

9D
9D

1B
1B
1B
F9

40
40

YF
F

D5
D5
D5

Y
3Y

BX
X

Q.6 (a) Explain Modes of 8255 with a neat block diagram. Show the CWR [10]
03
03
1B

F9
F9
F9
40

51

X4

initialization.
4
D5

3Y
3Y
Y

X
BX

9D
03

1B
1B
F9

40
40

YF
X4

(b) Write an ALP for 8086 to transfer the block of data.

D5
D5
Y

BX
BX

03
03
1B

F9
F9

51
51

X4
X4
D5

3Y
Y

9D
9D
03

1B
1B
F9

40

YF
F
X4

D5
5

Y
3Y

BX
9D

03
03
1B

F9

*****************
51
YF

X4
X4
5

3Y

9D
9D
3

1B
1B

40
40

YF
YF

D5
5

X
BX

9D

03
3

1B

F9
40
51

YF

X4
5

3Y
BX

9D
9D

1B

40
40
1

YF

D5
D5

BX
BX

F9
F9

40

51
1
D5

Y
3Y

BX

9D
3
F9

55640 Page 1 of 1
40
40

YF
D5
3Y

BX
BX

03
9
0

1
YF

X4
X4

D5
03

1B

X403YF9D51BX403YF9D51BX403YF9D51BX403YF9D51B
1B

F9