F A E 90 19 E 1 4 3 0C

F5 51A4 4EDD90 919 EEAA13 334F F336 60C A97

1A E 9 91 EE 1 34 3 0 A E
1A 4E D90 0919 9EE A1 334 F33 360C CA9 97E D63
D 3 F D
A4 4ED 909 919E EEAA13 34F 336 60C A97 7ED 63F F51A
ED 90 19 EA 13 34F 336 0C A9 ED 63 51 4E
4E 9 91 EE 1 34 33 0 A 7E 6 F5 A4 D
D 09 9E A 33 F 6 CA 97 D 3F 1A E 9
D9 9091 19E EA 133 4F3 3360 0CA 97E ED6 63F5 51A 4EDD90 0919
0 E 1 4 3 C 9 3 4 9 E
90 919 9EE A13 334F F33 60C A9 7EDD63 F51 1A4 ED9 909 19E EA
91 EE A1 34 33 60 A 7E 6 F5 A4 ED 09 19 EA 13

67635
09 9E A 33 F3 6 CA 97 D 3F 1A E 90 1 EE 1 34
1 0 E 6 9

(c)

Q.2 (a)

(b)
91 9EE EA1 1334 4F33 360 CA 97E D6 3F5 51A4 4EDD909 919 EEAA13 334F F336
9E A 33 F3 60 CA 97 D6 3F 1A E 90 19 EE 1 34 33 0C
9E EA 133 4F3 360 CA 97 ED6 3F 51A 4E D90 919 EE A1 334 F33 60C A9
1 E 5 D 3
EE EA1 334 4F33 360C CA9 97E D63 3F5 1A4 4ED 909 919E EEAA13 34F F336 60C A97 7ED

The
A1 334 F3 60 A 7E D6 F5 1A ED 90 19 EA 13 34F 33 0C A9 ED 63

250?
33 F3 360 CA 97E D6 3F5 1A 4ED 90 919 EE 13 34 33 60C A9 7ED 63 F51
4F 36 C 97 D 3F 1A 4E 9 91 EE A1 34 F3 60 A 7E 6 F5 A

3
33 0C A9 ED 63 51 4 D 09 9E A 33 F3 36 CA 97 D 3F 1A 4E
60 A 7E 6 F5 A ED 90 19 EA 13 4F 36 0C 9 ED 63 51 4 D9
CA 97 D 3F 1A 4E 90 91 EE 1 34 33 0C A9 7E 63 F5 A4 ED 09

Evaluate ∮
97 ED 63F 51A 4E D9 91 9EE A1 334 F33 60 A9 7E D6 F5 1A4 ED 909 19

incomes
ED 63 51 4 D9 09 9E A 33 F3 60 CA 7E D6 3F 1A E 90 19 EE

5
63 F51 A4 ED 09 19E EA 133 4F3 36 CA 97 D6 3F 51A 4E D90 91 EE A1

of significance.

of
𝑥 = 𝑡, 𝑦 = 𝑡 2 .

of convergence.
F5 A4 ED 90 19 EA 13 4F 36 0C 97 ED 3F 51 4E D9 91 9E A 33

a
subject to
1A E 90 919 EE 1 34 33 0C A9 E 63 51 A4 D 09 9E EA 13 4F

⁄6
𝑠𝑖𝑛6 𝑧
4E D9 91 EE A1 334 F33 60 A 7E D6 F5 A4 ED 90 19 EA 13 34F 336

7
3 10 5
D9 091 9E A 33 F3 60 CA 97E D6 3F5 1A ED 90 919 EE 1 34 33 0C

(𝑧−𝜋 )𝑛

A = [−2 −3 −4]
09 9E EA 133 4F3 36 CA 97 D 3F 1A 4E 90 91 EE A1 334 F33 60 A9
19 EA 13 4F 36 0C 9 ED 63 51 4E D9 91 9E A 33 F3 60 CA 7E

group
EE 1 34 33 0C A9 7E 63 F5 A4 D 09 9E EA 13 4F 36 C 97 D
A1 334 F3 60 A 7E D6 F5 1A ED 90 19 EA 13 34F 33 0C A9 ED 63
33 F3 360 CA 97E D6 3F5 1A 4ED 90 919 EE 13 34 33 60C A9 7ED 63 F51
4F 36 C 97 D 3F 1A 4E 9 91 EE A1 34 F3 60 A 7E 6 F5 A
N.B. (1) Question No. 1 is compulsory.

𝑥1 ≤ 4 ,
33 0C A9 ED 63 51 4 D 09 9E A 33 F3 36 CA 97 D 3F 1A 4E

𝑥2 ≤ 6 ,
60 A 7E 6 F5 A ED 90 19 EA 13 4F 36 0C 9 ED 63 51 4 D9
CA 97 D 3F 1A 4E 90 91 EE 1 34 33 0C A9 7E 63 F5 A4 ED 09

𝑥1 , 𝑥2 ≥ 0
Maximize 𝑧 = 3 𝑥1 + 5𝑥2

Iliterates
Literates
97 ED 63F 51A 4E D9 91 9EE A1 334 F33 60 A9 7E D6 F5 1A4 ED 909 19
(3) Use of Statistical Tables permitted.

ED 63 51 4 D9 09 9E A 33 F3 60 CA 7E D6 3F 1A E 90 19 EE
63 F51 A4 ED 09 19E EA 133 4F3 36 CA 97 D6 3F 51A 4E D90 91 EE A1
(Time: 3 hours)

F5 A4 ED 90 19 EA 13 4F 36 0C 97 ED 3F 51 4E D9 91 9E A 33
(4) Figures to the right indicate full marks.

3𝑥1 + 2𝑥2 ≤ 18,

1A E 90 919 EE 1 34 33 0C A9 E 63 51 A4 D 09 9E EA 13 4F
4E D9 91 EE A1 334 F33 60 A 7E D6 F5 A4 ED 90 19 EA 13 34F 336

35
40
D9 091 9E A 33 F3 60 CA 97E D6 3F5 1A ED 90 919 EE 1 34 33 0C

Page 1 of 2
09 9E EA 133 4F3 36 CA 97 D 3F 1A 4E 90 91 EE A1 334 F33 60 A9
(2) Answer any three questions from Q.2 to Q.6.

19 EA 13 4F 36 0C 9 ED 63 51 4E D9 91 9E A 33 F3 60 CA 7E
EE 1 34 33 0C A9 7E 63 F5 A4 D 09 9E EA 13 4F 36 C 97 D
A1 334 F3 60 A 7E D6 F5 1A ED 90 19 EA 13 34F 33 0C A9 ED 63

(b) Solve the following LPP using Simplex Method

33 F3 360 CA 97E D6 3F5 1A 4ED 90 919 EE 13 34 33 60C A9 7ED 63 F51
4F 36 C 97 D 3F 1A 4E 9 91 EE A1 34 F3 60 A 7E 6 F5 A
33 0C A9 ED 63 51 4 D 09 9E A 33 F3 36 CA 97 D 3F 1A 4E
60 A 7E 6 F5 A ED 90 19 EA 13 4F 36 0C 9 ED 63 51 4 D9
CA 97 D 3F 1A 4E 90 91 EE 1 34 33 0C A9 7E 63 F5 A4 ED 09

85
35

(c) Obtain Taylor’s and Laurent’s expansions of 𝑓(𝑧) =

97 ED 63F 51A 4E D9 91 9EE A1 334 F33 60 A9 7E D6 F5 1A4 ED 909 19
ED 63 51 4 D9 09 9E A 33 F3 60 CA 7E D6 3F 1A E 90 19 EE

ED63F51A4ED90919EEA1334F3360CA97
63 F51 A4 ED 09 19E EA 133 4F3 36 CA 97 D6 3F 51A 4E D90 91 EE A1

2
F5 A4 ED 90 19 EA 13 4F 36 0C 97 ED 3F 51 4E D9 91 9E A 33
2𝑥1 + 6𝑥2 + 2𝑥3 + 𝑥4 = 3 ; 6𝑥1 + 4𝑥2 + 4𝑥3 + 6𝑥4 = 2

Smokers Non-smokers
1A E 90 919 EE 1 34 33 0C A9 E 63 51 A4 D 09 9E EA 13 4F
4E D9 91 EE A1 334 F33 60 A 7E D6 F5 A4 ED 90 19 EA 13 34F 336

𝑧−1
D9 091 9E A 33 F3 60 CA 97E D6 3F5 1A ED 90 919 EE 1 34 33 0C

Q.3 (a) Find the Eigen values and Eigen vectors of the following matrix.
09 9E EA 133 4F3 36 CA 97 D 3F 1A 4E 90 91 EE A1 334 F33 60 A9

𝑧 −2𝑧−3
19 EA 13 4F 36 0C 9 ED 63 51 4E D9 91 9E A 33 F3 60 CA 7E
EE 1 34 33 0C A9 7E 63 F5 A4 D 09 9E EA 13 4F 36 C 97 D
𝑑𝑧 where c is the circle |𝑧| = 1 for n = 1, n =3.
Paper / Subject Code: 40501 / Applied Mathematics-IV

A1 334 F3 60 A 7E D6 F5 1A ED 90 19 EA 13 34F 33 0C A9 ED 63
33 F3 360 CA 97E D6 3F5 1A 4ED 90 919 EE 13 34 33 60C A9 7ED 63 F51
4F 36 C 97 D 3F 1A 4E 9 91 EE A1 34 F3 60 A 7E 6 F5 A
33 0C A9 ED 63 51 4 D 09 9E A 33 F3 36 CA 97 D 3F 1A 4E
is also 6. If one of the Eigen value is one, find the other two Eigen values.

60 A 7E 6 F5 A ED 90 19 EA 13 4F 36 0C 9 ED 63 51 4 D9
CA 97 D 3F 1A 4E 90 91 EE 1 34 33 0C A9 7E 63 F5 A4 ED 09
cms. Is the machine fulfilling the purpose? Test at 1% Level of Significance.

97 ED 63F 51A 4E D9 91 9EE A1 334 F33 60 A9 7E D6 F5 1A4 ED 909 19

Q.1 (a) Find all basic, feasible and degenerate solutions for the following equations:

ED 63 51 4 D9 09 9E A 33 F3 60 CA 7E D6 3F 1A E 90 19
63 F51 A4 ED 09 19E EA 133 4F3 36 CA 97 D6 3F 51A 4E D90 91 E
F5 A4 ED 90 19 EA 13 4F 36 0C 97 ED 3F 51 4E D9 91 9E
(b) Integrate the function 𝑓(𝑧) = 𝑥 2 + 𝑖 𝑥𝑦 from A ( 1,1) to B (2,4) along the curve

1A E 90 919 EE 1 34 33 0C A9 E 63 51 A4 D 09 9E E
4E D9 91 EE A1 334 F33 60 A 7E D6 F5 A4 ED 90 19 EA
A machine is set to produce metal plates of thickness 1.5 cms with S.D. of 0.2 cms.

(d) The sum of the Eigen values of a 3 × 3 matrix is 6 and the product of the Eigen values

indicating region
of 10,000 persons were found to be normally distributed with
there is no relation between smoking and literacy? Use Chi-square test at 5% Level
(c) The following data is collected on two characters. Based on this, can you say that

D9 091 9E A 33 F3 60 CA 97E D6 3F5 1A ED 90 919 EE

09 9E EA 133 4F3 36 CA 97 D 3F 1A 4E 90 91 EE A1
19 EA 13 4F 36 0C 9 ED 63 51 4E D9 91 9E A 3
EE 1 34 33 0C A9 7E 63 F5 A4 D 09 9E EA 13
Max. Marks: 80

08
mean of rs. 750 and Standard deviation of rs. 50. What is the lowest income of richest 06
06
08
06
06
05
A sample of 100 plates produced by the machine gave an average thickness of 1.52 05
05
05

A1 334 F3 60 A 7E D6 F5 1A ED 90 19 EA 13 3
33 F3 360 CA 97E D6 3F5 1A 4ED 90 919 EE 13 34
4F 36 C 97 D 3F 1A 4E 9 91 EE A1 34
33 0C A9 ED 63 51 4 D 09 9E A 33 F3
60 A 7E 6 F5 A ED 90 19 EA 13 4F
CA 97 D 3F 1A 4E 90 91 EE 1 34 33
97 ED 63F 51A 4E D9 91 9EE A1 334 F33
ED 63 51 4 D9 09 9E A 33 F3 60
63 F51 A4 ED 09 19E EA 133 4F3 36
F E 9 1 1 0
 F A E 90 19 E 1 4 3 0C
F5 51A4 4EDD90 919 EEAA13 334F F336 60C A97
1A E 9 91 EE 1 34 3 0 A E
1A 4E D90 0919 9EE A1 334 F33 360C CA9 97E D63
D 3 F D
A4 4ED 909 919E EEAA13 34F 336 60C A97 7ED 63F F51A
ED 90 19 EA 13 34F 336 0C A9 ED 63 51 4E
4E 9 91 EE 1 34 33 0 A 7E 6 F5 A4 D
D 09 9E A 33 F 6 CA 97 D 3F 1A E 9
D9 9091 19E EA 133 4F3 3360 0CA 97E ED6 63F5 51A 4EDD90 0919
0 E 1 4 3 C 9 3 4 9 E
90 919 9EE A13 334F F33 60C A9 7EDD63 F51 1A4 ED9 909 19E EA
91 EE A1 34 33 60 A 7E 6 F5 A4 ED 09 19 EA 13

67635
09 9E A 33 F3 6 CA 97 D 3F 1A E 90 1 EE 1 34
1 0 E 6 9

(c)
(c)
91 9EE EA1 1334 4F33 360 CA 97E D6 3F5 51A4 4EDD909 919 EEAA13 334F F336
9E A 33 F3 60 CA 97 D6 3F 1A E 90 19 EE 1 34 33 0C
9E EA 133 4F3 360 CA 97 ED6 3F 51A 4E D90 919 EE A1 334 F33 60C A9
1 E 5 D 3
EE EA1 334 4F33 360C CA9 97E D63 3F5 1A4 4ED 909 919E EEAA13 34F F336 60C A97 7ED
A1 334 F3 60 A 7E D6 F5 1A ED 90 19 EA 13 34F 33 0C A9 ED 63
33 F3 360 CA 97E D6 3F5 1A 4ED 90 919 EE 13 34 33 60C A9 7ED 63 F51
4F 36 C 97 D 3F 1A 4E 9 91 EE A1 34 F3 60 A 7E 6 F5 A
33 0C A9 ED 63 51 4 D 09 9E A 33 F3 36 CA 97 D 3F 1A 4E

subject to
60 A 7E 6 F5 A ED 90 19 EA 13 4F 36 0C 9 ED 63 51 4 D9
CA 97 D 3F 1A 4E 90 91 EE 1 34 33 0C A9 7E 63 F5 A4 ED 09

subject to
97 ED 63F 51A 4E D9 91 9EE A1 334 F33 60 A9 7E D6 F5 1A4 ED 909 19

find its mean.

ED 63 51 4 D9 09 9E A 33 F3 60 CA 7E D6 3F 1A E 90 19 EE
63 F51 A4 ED 09 19E EA 133 4F3 36 CA 97 D6 3F 51A 4E D90 91 EE A1
F5 A4 ED 90 19 EA 13 4F 36 0C 97 ED 3F 51 4E D9 91 9E A 33

Where 𝐴 = [ 0
2

−1
1A E 90 919 EE 1 34 33 0C A9 E 63 51 A4 D 09 9E EA 13 4F

1 −3 3
0 1 0
4E D9 91 EE A1 334 F33 60 A 7E D6 F5 A4 ED 90 19 EA 13 34F 336

𝐴 = [0 0 1]
D9 091 9E A 33 F3 60 CA 97E D6 3F5 1A ED 90 919 EE 1 34 33 0C

1
0
2
0
09 9E EA 133 4F3 36 CA 97 D 3F 1A 4E 90 91 EE A1 334 F33 60 A9

Minimise 𝑧 = 𝑥1 + 𝑥2
19 EA 13 4F 36 0C 9 ED 63 51 4E D9 91 9E A 33 F3 60 CA 7E
EE 1 34 33 0C A9 7E 63 F5 A4 D 09 9E EA 13 4F 36 C 97 D
have (a) at least one boy

same normal population?

𝑥1 , 𝑥2 ≥ 0
A1 334 F3 60 A 7E D6 F5 1A ED 90 19 EA 13 34F 33 0C A9 ED 63

𝑥1 , 𝑥2 ≥ 0

−1
−𝑥1 − 𝑥2 ≥ 1
33 F3 360 CA 97E D6 3F5 1A 4ED 90 919 EE 13 34 33 60C A9 7ED 63 F51

0]
2 𝑥1 + 𝑥2 ≥ 2

−𝑥1 + 𝑥2 ≤ 5
𝑥1 + 𝑥2 ≤ 8
4F 36 C 97 D 3F 1A 4E 9 91 EE A1 34 F3 60 A 7E 6 F5 A
33 0C A9 ED 63 51 4 D 09 9E A 33 F3 36 CA 97 D 3F 1A 4E
60 A 7E 6 F5 A ED 90 19 EA 13 4F 36 0C 9 ED 63 51 4 D9
CA 97 D 3F 1A 4E 90 91 EE 1 34 33 0C A9 7E 63 F5 A4 ED 09
97 ED 63F 51A 4E D9 91 9EE A1 334 F33 60 A9 7E D6 F5 1A4 ED 909 19
ED 63 51 4 D9 09 9E A 33 F3 60 CA 7E D6 3F 1A E 90 19 EE
63 F51 A4 ED 09 19E EA 133 4F3 36 CA 97 D6 3F 51A 4E D90 91 EE A1
F5 A4 ED 90 19 EA 13 4F 36 0C 97 ED 3F 51 4E D9 91 9E A 33
1A E 90 919 EE 1 34 33 0C A9 E 63 51 A4 D 09 9E EA 13 4F
4E D9 91 EE A1 334 F33 60 A 7E D6 F5 A4 ED 90 19 EA 13 34F 336
(b) Using the Residue theorem, Evaluate ∫0

D9 091 9E A 33 F3 60 CA 97E D6 3F5 1A ED 90 919 EE 1 34 33 0C

Page 2 of 2
----------
2𝜋

09 9E EA 133 4F3 36 CA 97 D 3F 1A 4E 90 91 EE A1 334 F33 60 A9

Maximize 𝑧 = 10𝑥1 + 10𝑥2 − 𝑥1 2 − 𝑥2 2

19 EA 13 4F 36 0C 9 ED 63 51 4E D9 91 9E A 33 F3 60 CA 7E
EE 1 34 33 0C A9 7E 63 F5 A4 D 09 9E EA 13 4F 36 C 97 D
A1 334 F3 60 A 7E D6 F5 1A ED 90 19 EA 13 34F 33 0C A9 ED 63
(b) at most 2 girls.

33 F3 360 CA 97E D6 3F5 1A 4ED 90 919 EE 13 34 33 60C A9 7ED 63 F51

𝑑𝜃

4F 36 C 97 D 3F 1A 4E 9 91 EE A1 34 F3 60 A 7E 6 F5 A
33 0C A9 ED 63 51 4 D 09 9E A 33 F3 36 CA 97 D 3F 1A 4E

(b) A random variable X has the probability distribution

60 A 7E 6 F5 A ED 90 19 EA 13 4F 36 0C 9 ED 63 51 4 D9
of 93 hours. Discuss the significance of these results.

5−3 cos 𝜃

CA 97 D 3F 1A 4E 90 91 EE 1 34 33 0C A9 7E 63 F5 A4 ED 09
.

97 ED 63F 51A 4E D9 91 9EE A1 334 F33 60 A9 7E D6 F5 1A4 ED 909 19

ED 63 51 4 D9 09 9E A 33 F3 60 CA 7E D6 3F 1A E 90 19 EE

ED63F51A4ED90919EEA1334F3360CA97
63 F51 A4 ED 09 19E EA 133 4F3 36 CA 97 D6 3F 51A 4E D90 91 EE A1

Using Kuhn-Tucker conditions, solve the following NLPP

(c) Use the dual simplex method to solve the following L.P.P.

F5 A4 ED 90 19 EA 13 4F 36 0C 97 ED 3F 51 4E D9 91 9E A 33
1A E 90 919 EE 1 34 33 0C A9 E 63 51 A4 D 09 9E EA 13 4F
4E D9 91 EE A1 334 F33 60 A 7E D6 F5 A4 ED 90 19 EA 13 34F 336
D9 091 9E A 33 F3 60 CA 97E D6 3F5 1A ED 90 919 EE 1 34 33 0C
09 9E EA 133 4F3 36 CA 97 D 3F 1A 4E 90 91 EE A1 334 F33 60 A9
19 EA 13 4F 36 0C 9 ED 63 51 4E D9 91 9E A 33 F3 60 CA 7E

𝑃(𝑋 = 𝑥) = 8 3𝑐𝑥 , 𝑥 = 0, 1 2, 3. Find mean and variance.

EE 1 34 33 0C A9 7E 63 F5 A4 D 09 9E EA 13 4F 36 C 97 D
Paper / Subject Code: 40501 / Applied Mathematics-IV

A1 334 F3 60 A 7E D6 F5 1A ED 90 19 EA 13 34F 33 0C A9 ED 63
33 F3 360 CA 97E D6 3F5 1A 4ED 90 919 EE 13 34 33 60C A9 7ED 63 F51
Q.5 (a) Check whether the following matrix is Derogatory or Non-Derogatory:

4F 36 C 97 D 3F 1A 4E 9 91 EE A1 34 F3 60 A 7E 6 F5 A
33 0C A9 ED 63 51 4 D 09 9E A 33 F3 36 CA 97 D 3F 1A 4E
60 A 7E 6 F5 A ED 90 19 EA 13 4F 36 0C 9 ED 63 51 4 D9
CA 97 D 3F 1A 4E 90 91 EE 1 34 33 0C A9 7E 63 F5 A4 ED 09
97 ED 63F 51A 4E D9 91 9EE A1 334 F33 60 A9 7E D6 F5 1A4 ED 909 19
ED 63 51 4 D9 09 9E A 33 F3 60 CA 7E D6 3F 1A E 90 19
(ii) Find the Moment Generating Function of Binomial Distribution and hence

63 F51 A4 ED 09 19E EA 133 4F3 36 CA 97 D6 3F 51A 4E D90 91 E

Q.6 (a) Show that the matrix 𝐴 satisfies Cayley-Hamilton theorem and hence find 𝐴−1 .
(i) Out of 1000 families with 4 children each, how many would you expect to
from stock for testing purpose. He finds that ‘make A’ has a mean life of 1300

respectively. The sum of the squares of the deviations from the means are 26.94
(b) The means of two random samples of sizes 9 and 7 are 196.42 and 198.82
hrs with a S.D. of 82 hours and ‘make B’ has a mean life of 1248 hours with S.D.
Q.4 (a) A man buys 100 electric bulbs of each of two well-known makes taken at random

and 18.73 respectively. Can the samples be regarded to have been drawn from the

F5 A4 ED 90 19 EA 13 4F 36 0C 97 ED 3F 51 4E D9 91 9E
1A E 90 919 EE 1 34 33 0C A9 E 63 51 A4 D 09 9E E
4E D9 91 EE A1 334 F33 60 A 7E D6 F5 A4 ED 90 19 EA
D9 091 9E A 33 F3 60 CA 97E D6 3F5 1A ED 90 919 EE
09 9E EA 133 4F3 36 CA 97 D 3F 1A 4E 90 91 EE A1

08
06
06
08
06
06
06
06

19 EA 13 4F 36 0C 9 ED 63 51 4E D9 91 9E A 3
EE 1 34 33 0C A9 7E 63 F5 A4 D 09 9E EA 13
04+04

A1 334 F3 60 A 7E D6 F5 1A ED 90 19 EA 13 3
33 F3 360 CA 97E D6 3F5 1A 4ED 90 919 EE 13 34
4F 36 C 97 D 3F 1A 4E 9 91 EE A1 34
33 0C A9 ED 63 51 4 D 09 9E A 33 F3
60 A 7E 6 F5 A ED 90 19 EA 13 4F
CA 97 D 3F 1A 4E 90 91 EE 1 34 33
97 ED 63F 51A 4E D9 91 9EE A1 334 F33
ED 63 51 4 D9 09 9E A 33 F3 60
63 F51 A4 ED 09 19E EA 133 4F3 36
F E 9 1 1 0
 9 CD 97 6 5F 7 0C 55 0 33
96 6CD 978 864 45FF F71 10C 55C C08 8330 0D4
C 9 6 5 7 0 55 0 3 D F
CD D97 7864 45F FF7 10C C55 C08 833 30D 4FE E0B
8 F 1 C 0 4
D9 978 645 5FF 710 0C5 55C 083 330D D4F FE0 0BA AE9
6 F 7 C 5 0 3 B 6
97 7864 45F F71 10C 55C C08 833 0D4 4FE E0B AE E96C CD
86 5F F7 0C 55 0 33 0D F 0B AE 96 D 97
86 45F F7 10C 55 C0 833 0D 4F E0B AE 96 CD 97 864
8 E 8
64 45FF F71 10C 55C C08 330 0D4 4FE 0B AE 96C CD9 978 645 5FF
5F 7 0C 55 08 33 D FE 0B AE 96 D 78 64 FF 71
5F F7 10C 55 C08 33 0D 4FE 0B AE 96 CD 978 64 5FF 71 0C5
1 C 0 4 C 5 0

55801
Q.5.
Q.4.
Q.3.
Q.2.

Q.6)
Q.1)
FF F71 0C5 55C 083 330 D4 FE0 0BA AE9 96C D9 9786 645 FF7 710 C55 5C0
71 0C 5C 08 30 D4 FE B E 6C D9 78 45 FF 10 C5 C 83
71 0C 55C 08 330 D4 FE 0B AE 96C D9 78 645 FF 710 C5 5C 083 30D
5 3 0 A 9 6 7 0

4)
5)
3)
2)
1)

B)
B)
B)
B)

A)
A)
A)
A)
10 0C5 5C0 083 30D D4F FE0 BA E9 6CD D97 786 45F FF7 10C C55 5C0 833 30D 4FE
C5 5C 83 30 4 E0 BA E9 6C 9 86 45 F7 10 55 C0 83 0D 4F 0
5C 08 30 D4 FE BA E9 6C D9 786 45 FF 10 C5 C0 83 30D 4F E0 BA
08 330 D4 FE 0B E 6C D9 78 45 FF 710 C5 5C 83 30D 4F E0 BA E9
33 D FE 0B AE 96 D 78 64 FF 71 C 5C 08 30 4 E BA E 6C
0D 4F 0B A 96 CD 97 64 5F 71 0C 55 08 33 D FE 0B E 96 D
4F E0 A E96 CD 97 864 5F F71 0C 55 C08 33 0D 4FE 0B AE 96 CD 978
Note:

E0 BA E9 C 9 86 5F F7 0C 55 C0 33 0D 4F 0B AE 96 CD 97 64

strings.
BA E9 6C D9 786 45 F7 10 55 C0 83 0D 4F E0 A 96 CD 97 86 5F

for N =4.
E9 6C D9 786 45 FF7 10 C55 C0 833 30D 4F E0B BA E96 CD 97 864 45F F71
notations.
6C D9 786 45 FF 10 C5 C0 83 0D 4F E0 A E9 CD 97 86 5F F7 0C
D9 78 45 FF 710 C5 5C 83 30D 4F E0 BA E9 6C 9 86 45F F7 10C 55
Solve any 4

78 645 FF 710 C5 5C 083 30 4F E0 BA E9 6C D9 786 45F F7 10 55 C0

programming.
64 FF 71 C 5C 08 30 D4 E B E 6C D9 78 45 F 10 C5 C 83
5F 7 0C 55 08 33 D FE 0B AE 96 D 78 64 FF 71 C5 5C 08 30

T(n)=8T(n/2)+n2
F7 10C 55 C0 33 0D 4F 0B AE 96 CD 97 64 5F 71 0C 5C 08 33 D4
Duration : 3 Hrs

10 5 C0 83 0D 4F E0 A 9 CD 97 86 5F F7 0C 55 0 33 0D FE
C5 5C 83 30 4 E0 BA E9 6C 9 86 45 F7 10 55 C0 83 0D 4F 0
5C 08 30 D4 FE BA E9 6C D9 786 45 FF 10 C5 C0 83 30D 4F E0 BA
08 330 D4 FE 0B E 6C D9 78 45 FF 710 C5 5C 83 30D 4F E0 BA E9
33 D FE 0B AE 96 D 78 64 FF 71 C 5C 08 30 4 E BA E 6C
0D 4F 0B A 96 CD 97 64 5F 71 0C 55 08 33 D FE 0B E 96 D

X=ABACABB Y= BABCAB
4F E0 A E96 CD 97 864 5F F71 0C 55 C08 33 0D 4FE 0B AE 96 CD 978

Write short note on any 2.

E0 BA E9 C 9 86 5F F7 0C 55 C0 33 0D 4F 0B AE 96 CD 97 64
BA E9 6C D9 786 45 F7 10 55 C0 83 0D 4F E0 A 96 CD 97 86 5F

(a) Assembly Line Scheduling

E9 6C D9 786 45 FF7 10 C55 C0 833 30D 4F E0B BA E96 CD 97 864 45F F71
6C D9 786 45 FF 10 C5 C0 83 0D 4F E0 A E9 CD 97 86 5F F7 0C
1) Question No 1 is compulsory.

D9 78 45 FF 710 C5 5C 83 30D 4F E0 BA E9 6C 9 86 45F F7 10C 55

example of graph with 5 vertices.

78 645 FF 710 C5 5C 083 30 4F E0 BA E9 6C D9 786 45F F7 10 55 C0

(b) Job Sequencing with Deadlines

64 FF 71 C 5C 08 30 D4 E B E 6C D9 78 45 F 10 C5 C 83

Page 1 of 1
5F 7 0C 55 08 33 D FE 0B AE 96 D 78 64 FF 71 C5 5C 08 30
F7 10C 55 C0 33 0D 4F 0B AE 96 CD 97 64 5F 71 0C 5C 08 33 D4
10 5 C0 83 0D 4F E0 A 9 CD 97 86 5F F7 0C 55 0 33 0D FE
C5 5C 83 30 4 E0 BA E9 6C 9 86 45 F7 10 55 C0 83 0D 4F 0

*******************
5C 08 30 D4 FE BA E9 6C D9 786 45 FF 10 C5 C0 83 30D 4F E0 BA
08 330 D4 FE 0B E 6C D9 78 45 FF 710 C5 5C 83 30D 4F E0 BA E9
33 D FE 0B AE 96 D 78 64 FF 71 C 5C 08 30 4 E BA E 6C
Write a note on “Optimal Storage on Tapes”.

0D 4F 0B A 96 CD 97 64 5F 71 0C 55 08 33 D FE 0B E 96 D

n=6, p=(18, 5, 9, 10, 12, 7) w=(7, 2, 3, 5, 3, 2)

4F E0 A E96 CD 97 864 5F F71 0C 55 C08 33 0D 4FE 0B AE 96 CD 978
divide and conquer. Also derive its complexity.

E0 BA E9 C 9 86 5F F7 0C 55 C0 33 0D 4F 0B AE 96 CD 97 64

FE0BAE96CD978645FF710C55C08330D4
(c) 15 Puzzle Problem (d) P, NP and NPC Classes
BA E9 6C D9 786 45 F7 10 55 C0 83 0D 4F E0 A 96 CD 97 86 5F

Prove that Vertex Cover problem is NP Complete.

E9 6C D9 786 45 FF7 10 C55 C0 833 30D 4F E0B BA E96 CD 97 864 45F F71
6C D9 786 45 FF 10 C5 C0 83 0D 4F E0 A E9 CD 97 86 5F F7 0C
Solve fractional knapsack problem for the following.

D9 78 45 FF 710 C5 5C 83 30D 4F E0 BA E9 6C 9 86 45F F7 10C 55

78 645 FF 710 C5 5C 083 30 4F E0 BA E9 6C D9 786 45F F7 10 55 C0
64 FF 71 C 5C 08 30 D4 E B E 6C D9 78 45 F 10 C5 C 83
5F 7 0C 55 08 33 D FE 0B AE 96 D 78 64 FF 71 C5 5C 08 30
Paper / Subject Code: 40502 / Analysis of Algorithms

following problem. n=4, w = {4, 5, 8, 9}, required sum = 9.

F7 10C 55 C0 33 0D 4F 0B AE 96 CD 97 64 5F 71 0C 5C 08 33 D4
10 5 C0 83 0D 4F E0 A 9 CD 97 86 5F F7 0C 55 0 33 0D FE
C5 5C 83 30 4 E0 BA E9 6C 9 86 45 F7 10 55 C0 83 0D 4F 0
2) Solve any three questions out of remaining five questions.

What is asymptotic analysis? Define Big O, Omega and Theta

Find the longest common subsequence for the following two

Write an algorithm for finding minimum and maximum using

5C 08 30 D4 FE BA E9 6C D9 786 45 FF 10 C5 C0 83 30D 4F E0 BA
08 330 D4 FE 0B E 6C D9 78 45 FF 710 C5 5C 83 30D 4F E0 BA E9
Write an algorithm to find all pairs shortest path using dynamic

33 D FE 0B AE 96 D 78 64 FF 71 C 5C 08 30 4 E BA E 6C
Derive the complexity of quick sort for best case and worst case.

Write an algorithm to solve sum of subset problem and solve the

Write an algorithm to solve N Queens problem. Show its working
Write Kruskal’s algorithm and show its working by taking suitable

0D 4F 0B A 96 CD 97 64 5F 71 0C 55 08 33 D FE 0B E 96 D
Define master theorem. Solve the following using master method.

Write an algorithm for Knuth Morris Pratt (KMP) pattern matching.

4F E0 A E96 CD 97 864 5F F71 0C 55 C08 33 0D 4FE 0B AE 96 CD 97

Maximum Marks : 80

E0 BA E9 C 9 86 5F F7 0C 55 C0 33 0D 4F 0B AE 96 CD 97
BA E9 6C D9 786 45 F7 10 55 C0 83 0D 4F E0 A 96 CD 97 8
E9 6C D9 786 45 FF7 10 C55 C0 833 30D 4F E0B BA E96 CD 97 864
6C D9 786 45 FF 10 C5 C0 83 0D 4F E0 A E9 CD 97 86

20
10
10
10
10
10
10
10
10
20

D9 78 45 FF 710 C5 5C 83 30D 4F E0 BA E9 6C 9 86 45
78 645 FF 710 C5 5C 083 30 4F E0 BA E9 6C D9 786 45F
64 FF 71 C 5C 08 30 D4 E B E 6C D9 78 45 F
5F 7 0C 55 08 33 D FE 0B AE 96 D 78 64 FF
F7 10C 55 C0 33 0D 4F 0B AE 96 CD 97 64 5F 7
10 5 C0 83 0D 4F E0 A 9 CD 97 86 5F F7
C5 5C 83 30 4 E0 BA E9 6C 9 86 45 F7 10
5C 08 30 D4 FE BA E9 6C D9 786 45 FF 10
08 330 D4 FE 0B E 6C D9 78 45 FF 710 C
33 D FE 0B AE 96 D 78 64 FF 71 C
0D 4F 0B A 96 CD 97 64 5F 71 0C 55
4F E0 A E96 CD 97 864 5F F71 0C 55
E0 BA E9 C 9 86 5F F7 0C 55 C
B E 6C D9 78 45 F 10 5 C
 1B 1A D0 BB 4D C 36 E2 5C 69
3 8 D
B1 1AD D0B BB2 24D C3 36E E28 5C6 69D 56
A 0 B 4 D C 3 3 6 2 8 5 C 9 5 7
1A D0 BB 24 C 36 E2 5C 69 D5 677 752
D 3 8 D 6 E
AD D0B BB2 24D C3 36E E28 5C 69D 56 775 52E D7
4 C 3 5 6 7 2 D 1
D0 0BB B24 DC 336 6E2 285C C69 9D5 5677 752 ED 71B B1A
D 3 8 D 6 E 7
0B BB2 24D C3 36E E28 5C6 69D 56 775 52E D7 1B1 1AD D0B
B 4D C3 36 2 5C 9 5 77 2E D7 1B A 0 B




B2 24D C3 36E E28 85C 69D D56 6775 52E D7 1B 1AD D0B BB2 24D
C 3 5 6 7 D 1 1
24 4DC 336 6E2 285 C69 9D5 567 752 2ED 71B B1A AD0 0BB B24 4DC C33
D 3 E 8 C D 6 7 E 7 6

Q.6.
Q.5.
Q.4.
Q.3.
Q.2.
Q.1.
4D C3 36E 28 5C 69D 56 77 52E D7 1B 1A D0B BB 24D DC3 336 E28
C3 36 28 5C 69D 56 77 52E D7 1B 1A D0 B 24D C3 36 E28 5C

c
a

d
b

a.
C3 36 E28 5C 69D 56 77 52E D7 1B 1A D0 BB 24D C3 36 E28 5C 69

c.
E 5 1 D B 2 E

d.
b.
6 6 D
33 36E2 285 5C6 9D 567 7752 2ED D71 1B1 AD 0B B24 4DC C33 36E 285 5C6 9D 567
9 5 A
6E 85 C6 D 6 75 E 71 B1 D 0B 2 D 3 6E 8 C6 9D 56 75 B 2
28 C 9D 56 775 2E D7 B AD 0B B2 4D C3 36E 28 5C 9D 56 775 2E
5C 69 56 77 2E D7 1B 1A 0 B 4D C 36 2 5C 69 5 77 2E D7
(80 Marks)

69 D5 77 52 D 1B 1A D0 BB 24 C 336 E2 85C 69 D5 677 52 D 1B

D5 67 52 ED 71 1A D BB 24 DC 33 E2 85 6 D5 67 52 ED 71 1A

example.
67 752 ED 71 B1 D 0B 24 DC 33 6E 85 C6 9D 67 752 ED 71 B1 D
75 ED 71 B1 AD 0B B2 D 33 6E 28 C6 9D 56 75 E 71 B1 AD 0B
2E 7 B A 0B B2 4D C3 6E 28 5C 9D 56 77 2E D7 B A 0B B

Architecture
D7 1B 1A D0 B 4D C3 36 28 5C 69 5 77 52E D7 1B 1A D0 B 24D
1B 1A D0 BB 24D C 36 E2 5C 69 D5 677 52E D 1B 1A D0 BB 24 C

Modes of DMA
Write short note on
1A D0 BB 24 C 336 E2 85C 69 D5 677 52 D 71B 1A D0 BB 24 DC 336
D0 BB 24 DC 336 E2 85C 69 D5 677 52 ED 71B 1A D0 BB 24 DC 33 E2

Interrupt driven I/O

BB 24 DC 33 E2 85 69 D5 67 52 ED 71 1A D BB 24 DC 33 6E2 85

Interleaved memory
Hazards in Pipelining
Question no. 1 is compulsory.

24 DC 336 6E2 85 C69 D5 67 752 ED 71B B1A D0 0BB 24 DC 33 6E2 85 C69

DC 33 E 85 C6 D 67 75 ED 71 1 D B 2 DC 33 6E 85 C6 D
33 6E2 285 C6 9D 567 752 2ED 71 B1 AD 0B B24 4DC 33 6E 285 C6 9D 567
Assume suitable data, if necessary.

6E 85 C6 9D 56 75 E 71 B1 AD 0B B2 D 3 6E 28 C6 9D 56 75
28 C 9D 56 775 2E D7 B AD 0B B2 4D C3 36E 28 5C 9D 56 775 2E
5C 69 56 77 2E D7 1B 1A 0 B 4D C 36 2 5C 69 5 77 2E D7
69 D5 77 52 D 1B 1A D0 BB 24 C 336 E2 85C 69 D5 677 52 D 1B

microprogrammed control unit.

Answer following questions in brief.

D5 67 52 ED 71 1A D BB 24 DC 33 E2 85 6 D5 67 52 ED 71 1A
67 752 ED 71 B1 D 0B 24 DC 33 6E 85 C6 9D 67 752 ED 71 B1 D
75 ED 71 B1 AD 0B B2 D 33 6E 28 C6 9D 56 75 E 71 B1 AD 0B

a. What is TLB? Explain working of TLB.

2E 7 B A 0B B2 4D C3 6E 28 5C 9D 56 77 2E D7 B A 0B B
D7 1B 1A D0 B 4D C3 36 28 5C 69 5 77 52E D7 1B 1A D0 B 24D

a. Explain the Bus Arbitration Techniques

Differentiate between SRAM and DRAM

methods to maintain cache consistency.

1B 1A D0 BB 24D C 36 E2 5C 69 D5 677 52E D 1B 1A D0 BB 24 C
and IEEE 64 bit Double Precision Format

1A D0 BB 24 C 336 E2 85C 69 D5 677 52 D 71B 1A D0 BB 24 DC 336

b. Describe register organization within CPU.

D0 BB 24 DC 336 E2 85C 69 D5 677 52 ED 71B 1A D0 BB 24 DC 33 E2
Answer any three questions from question no. 2 – 6.

BB 24 DC 33 E2 85 69 D5 67 52 ED 71 1A D BB 24 DC 33 6E2 85 b. Explain DMA based data transfer techniques.

Explain function of 8089 I/O processor in brief.

24 DC 336 6E2 85 C69 D5 67 752 ED 71B B1A D0 0BB 24 DC 33 6E2 85 C69

DC 33 E 85 C6 D 67 75 ED 71 1 D B 2 DC 33 6E 85 C6 D
33 6E2 285 C6 9D 567 752 2ED 71 B1 AD 0B B24 4DC 33 6E 285 C6 9D 567

_________________
6E 85 C6 9D 56 75 E 71 B1 AD 0B B2 D 3 6E 28 C6 9D 56 75
28 C 9D 56 775 2E D7 B AD 0B B2 4D C3 36E 28 5C 9D 56 775 2E
Discuss difference between RISC and CISC processors.

5C 69 56 77 2E D7 1B 1A 0 B 4D C 36 2 5C 69 5 77 2E D7
69 D5 77 52 D 1B 1A D0 BB 24 C 336 E2 85C 69 D5 677 52 D 1B
D5 67 52 ED 71 1A D BB 24 DC 33 E2 85 6 D5 67 52 ED 71 1A
67 752 ED 71 B1 D 0B 24 DC 33 6E 85 C6 9D 67 752 ED 71 B1 D

567752ED71B1AD0BB24DC336E285C69D
75 ED 71 B1 AD 0B B2 D 33 6E 28 C6 9D 56 75 E 71 B1 AD 0B
2E 7 B A 0B B2 4D C3 6E 28 5C 9D 56 77 2E D7 B A 0B B
D7 1B 1A D0 B 4D C3 36 28 5C 69 5 77 52E D7 1B 1A D0 B 24D
1B 1A D0 BB 24D C 36 E2 5C 69 D5 677 52E D 1B 1A D0 BB 24 C
1A D0 BB 24 C 336 E2 85C 69 D5 677 52 D 71B 1A D0 BB 24 DC 336
D0 BB 24 DC 336 E2 85C 69 D5 677 52 ED 71B 1A D0 BB 24 DC 33 E2
BB 24 DC 33 E2 85 69 D5 67 52 ED 71 1A D BB 24 DC 33 6E2 85
24 DC 336 6E2 85 C69 D5 67 752 ED 71B B1A D0 0BB 24 DC 33 6E2 85 C69
DC 33 E 85 C6 D 67 75 ED 71 1 D B 2 DC 33 6E 85 C6 D
33 6E2 285 C6 9D 567 752 2ED 71 B1 AD 0B B24 4DC 33 6E 285 C6 9D 567
6E 85 C6 9D 56 75 E 71 B1 AD 0B B2 D 3 6E 28 C6 9D 56 75
28 C 9D 56 775 2E D7 B AD 0B B2 4D C3 36E 28 5C 9D 56 775 2E
5C 69 56 77 2E D7 1B 1A 0 B 4D C 36 2 5C 69 5 77 2E D7
69 D5 77 52 D 1B 1A D0 BB 24 C 336 E2 85C 69 D5 677 52 D 1B
Convert the following number 256.325 into IEEE 32 bit Single Precision Format

a. Explain cache consistency and coherency with suitable examples. Also, give

b. Compare between Cache Look Aside Architecture and Cache Look through
a. Explain how Virtual Address is translated to Physical address with suitable

b. Explain hardwired Control Unit with help of neat diagram. Compare it with

D5 67 52 ED 71 1A D BB 24 DC 33 E2 85 6 D5 67 52 ED 71
67 752 ED 71 B1 D 0B 24 DC 33 6E 85 C6 9D 67 752 ED 71 B1
(3 Hours)

75 ED 71 B1 AD 0B B2 D 33 6E 28 C6 9D 56 75 E 71 B1
2E 7 B A 0B B2 4D C3 6E 28 5C 9D 56 77 2E D7 B A
D7 1B 1A D0 B 4D C3 36 28 5C 69 5 77 52E D7 1B 1A

(05)
(05)
(05)
(05)
(10)
(10)
(10)
(10)
(10)
(10)
(05)
(05)
(05)
(05)

(12)
(08)
Paper / Subject Code: 38903 / COMPUTER ORGANIZATIN AND ARCHIECTURE

1B 1A D0 BB 24D C 36 E2 5C 69 D5 677 52E D 1B 1A D0

1A D0 BB 24 C 336 E2 85C 69 D5 677 52 D 71B 1A D0
Q.P. Code: 40879

D0 BB 24 DC 336 E2 85C 69 D5 677 52 ED 71B 1A D0 B

BB 24 DC 33 E2 85 69 D5 67 52 ED 71 1A D BB
24 DC 336 6E2 85 C69 D5 67 752 ED 71B B1A D0 0BB
DC 33 E 85 C6 D 67 75 ED 71 1 D B 2
33 6E2 285 C6 9D 567 752 2ED 71 B1 AD 0B B24 4
6E 85 C6 9D 56 75 E 71 B1 AD 0B B2 D
28 C 9D 56 775 2E D7 B AD 0B B2 4D
5C 69 56 77 2E D7 1B 1A 0 B 4D C
69 D5 77 52 D 1B 1A D0 BB 24 C
D5 67 52 ED 71 1A D BB 24 DC 33
67 752 ED 71 B1 D 0B 24 DC 33
A B
 3 3 2 9 E2 C2 7 1 7 C
38 823A A2A A9F FE2 C2E E7C C15 547B BC3 383
2 2 9 E C 7 1 4 C 8 2D
23 3A2 A9 FE2 2C2 2E7 C15 547 7BC 383 32D 6C
A2 A9 FE C E7 C1 47 BC 38 2D 6C AE
A2 A9 FE 2C 2E7 C1 547 BC 38 32D 6C AE 73
F 2 2 5 3 8
2A A9F E2C C2E E7C C15 47B BC3 3832 2D6 6CA AE7 738 23A
9 E 2 7 1 4 7 C 8 D C E 3 2
A9 FE 2C E7 C1 54 BC 38 32D 6C A 73 82 3A2 2A9
2 2 5 7 3 E 8 3
9F FE2 C2E E7C C15 47B BC3 383 2D6 6CA AE7 738 23A A2A A9F FE2
E C 4 2
7 1 7 C 8 D C E 3 23 2 9 E C

Q6
Q5
Q4
Q3
Q2
Q1
E2 2C2 2E7C C15 547 BC 383 32D 6C AE 738 823 A2A A9F FE2 2C2 2E7C
E B 3 6 A 7 A E

N.B:
2C C2E 7C 154 47B C38 832 2D6 CA E7 382 23A 2A 9FE E2C C2E 7C 154
2E 7C 154 7B C3 32 D6 CA E7 382 3A 2A 9FE 2C 2E 7C 154 7B

c)
c)

a)
a)
a)
a)
a)
a)

d)
b)
b)
b)
b)
b)
d)
b)
2E 7C 154 7B C3 832 D6 CA E7 382 3A 2A 9FE 2C 2E 7C 154 7B C3
8 8
E7 7C1 1547 7BC C38 32D D6C CAE E73 3823 3A2 2A9 9FE 2C2 2E7 7C1 1547 7BC C38 32D
C1 54 BC 38 32 6C A 73 82 A2 A9 FE 2C E7 C1 54 BC 38 32 6C
54 7B 38 32 D6 A E73 82 3A A FE 2C 2E C1 54 7B 38 32 D6 A
7B C3 32 D6 CA E7 82 3A 2A 9F 2C 2E 7C 54 7B C3 32 D6 CA E7

curve.
C3 83 D6 CA E7 38 3A 2A 9F E2 2E 7C 15 7B C3 83 D6 CA E7 38
83 2D CA E 38 23A 2A 9F E2 C2 7C 15 47B C3 83 2D CA E 38 23A
2D 6C E 73 23 2 9 E2 C2 E7 1 47 C 83 2D 6C E 73 23 2
6C AE 73 823 A2 A9 FE C2 E7 C1 547 BC 38 2D 6C AE 73 823 A2 A9

Koch curve
AE 73 823 A2 A9 FE 2C E7 C1 547 BC 38 32D 6C AE 73 823 A2 A9 FE
73 823 A2 A9 FE 2C2 2E7 C1 547 BC 38 32D 6C AE 73 823 A2 A9 FE 2C2
82 A A FE 2C E C1 54 B 38 32 6 A 73 82 A A FE 2C E
3A 2A 9F 2C 2E 7C 54 7B C3 32 D6 CA E7 82 3A 2A 9F 2C 2E 7C
2A 9F E2C 2E 7C 15 7B C3 832 D6 CA E7 38 3A 2A 9F E2C 2E 7C 15

Inside Outside test

9F E2 2E 7C 15 47B C3 83 D6 CA E7 38 23A 2A 9F E2 2E 7C 15 47B
E2 C2 7C 15 47 C 83 2D C E 38 23 2A 9F E2 C2 7C 15 47 C

Sweep representation
C2 E7 1 47 BC 383 2D 6C AE 73 23 A2 9 E2 C2 E7 1 47 BC 383

perspective projection.
E7 C1 547 BC 38 2D 6C AE 73 823 A2 A9 FE C2 E7 C1 547 BC 38 2D
C1 54 BC 38 32 6C A 73 82 A2 A9 FE 2C E7 C1 54 BC 38 32 6C

and (xmax,ymax)=(50,50).
54 7B 38 32 D6 A E73 82 3A A FE 2C 2E C1 54 7B 38 32 D6 A
7B C3 32 D6 CA E7 82 3A 2A 9F 2C 2E 7C 54 7B C3 32 D6 CA E7
(1) Question No.1 is compulsory

Gouraud and phong shading

C3 83 D6 CA E7 38 3A 2A 9F E2 2E 7C 15 7B C3 83 D6 CA E7 38

Write short notes on(any two)

83 2D CA E 38 23A 2A 9F E2 C2 7C 15 47B C3 83 2D CA E 38 23A
2D 6C E 73 23 2 9 E2 C2 E7 1 47 C 83 2D 6C E 73 23 2
What is aliasing and antialiasing?

6C AE 73 823 A2 A9 FE C2 E7 C1 547 BC 38 2D 6C AE 73 823 A2 A9

AE 73 823 A2 A9 FE 2C E7 C1 547 BC 38 32D 6C AE 73 823 A2 A9 FE
[3 Hours]

73 823 A2 A9 FE 2C2 2E7 C1 547 BC 38 32D 6C AE 73 823 A2 A9 FE 2C2

82 A A FE 2C E C1 54 B 38 32 6 A 73 82 A A FE 2C E
3A 2A 9F 2C 2E 7C 54 7B C3 32 D6 CA E7 82 3A 2A 9F 2C 2E 7C
2A 9F E2C 2E 7C 15 7B C3 832 D6 CA E7 38 3A 2A 9F E2C 2E 7C 15
9F E2 2E 7C 15 47B C3 83 D6 CA E7 38 23A 2A 9F E2 2E 7C 15 47B
E2 C2 7C 15 47 C 83 2D C E 38 23 2A 9F E2 C2 7C 15 47 C
(2) Attempt any three of remaining five questions

C2 E7 1 47 BC 383 2D 6C AE 73 23 A2 9 E2 C2 E7 1 47 BC 383
Prove that two successive rotations are additive

E7 C1 547 BC 38 2D 6C AE 73 823 A2 A9 FE C2 E7 C1 547 BC 38 2D

Explain the concept of halftoning with example.
Please check whether you have got the right question paper.

C1 54 BC 38 32 6C A 73 82 A2 A9 FE 2C E7 C1 54 BC 38 32 6C

_____________________
54 7B 38 32 D6 A E73 82 3A A FE 2C 2E C1 54 7B 38 32 D6 A
7B C3 32 D6 CA E7 82 3A 2A 9F 2C 2E 7C 54 7B C3 32 D6 CA E7
Write the flood fill approach for 8 connected method.

C3 83 D6 CA E7 38 3A 2A 9F E2 2E 7C 15 7B C3 83 D6 CA E7 38
83 2D CA E 38 23A 2A 9F E2 C2 7C 15 47B C3 83 2D CA E 38 23A
Explain the steps for 2D rotation about arbitrary point.

Explain Z Buffer algorithm for hidden surface removal.

2D 6C E 73 23 2 9 E2 C2 E7 1 47 C 83 2D 6C E 73 23 2

32D6CAE73823A2A9FE2C2E7C1547BC38
(3) Assume any suitable data if necessary and justify the same

6C AE 73 823 A2 A9 FE C2 E7 C1 547 BC 38 2D 6C AE 73 823 A2 A9

AE 73 823 A2 A9 FE 2C E7 C1 547 BC 38 32D 6C AE 73 823 A2 A9 FE
73 823 A2 A9 FE 2C2 2E7 C1 547 BC 38 32D 6C AE 73 823 A2 A9 FE 2C2
82 A A FE 2C E C1 54 B 38 32 6 A 73 82 A A FE 2C E
3A 2A 9F 2C 2E 7C 54 7B C3 32 D6 CA E7 82 3A 2A 9F 2C 2E 7C
2A 9F E2C 2E 7C 15 7B C3 832 D6 CA E7 38 3A 2A 9F E2C 2E 7C 15
Paper / Subject Code: 40504 / Computer Graphics

9F E2 2E 7C 15 47B C3 83 D6 CA E7 38 23A 2A 9F E2 2E 7C 15 47B

Plot the points for midpoint ellipse with rx=3 and ry=5 for region 1.

E2 C2 7C 15 47 C 83 2D C E 38 23 2A 9F E2 C2 7C 15 47 C
C2 E7 1 47 BC 383 2D 6C AE 73 23 A2 9 E2 C2 E7 1 47 BC 383
E7 C1 547 BC 38 2D 6C AE 73 823 A2 A9 FE C2 E7 C1 547 BC 38 2D
What is meant by parallel and perspective projection? Derive matrix for
C1 54 BC 38 32 6C A 73 82 A2 A9 FE 2C E7 C1 54 BC 38 32 6C
54 7B 38 32 D6 A E73 82 3A A FE 2C 2E C1 54 7B 38 32 D6 A
7B C3 32 D6 CA E7 82 3A 2A 9F 2C 2E 7C 54 7B C3 32 D6 CA E7
with coordinates (30,60) and (60,25) against the window(xmin,ymin)=(10,10)

Explain Weiler Artherton polygon clipping algorithm with suitable example.

C3 83 D6 CA E7 38 3A 2A 9F E2 2E 7C 15 7B C3 83 D6 CA E7 38
Explain Liang Barsky line clipping algorithm. Apply the algorithm to the line

Explain what is meant by Bezier curve? State the various properties of Bezier

83 2D CA E 38 23A 2A 9F E2 C2 7C 15 47B C3 83 2D CA E 38 2
What is window and viewport? Derive the matrix for viewport transformation.

2D 6C E 73 23 2 9 E2 C2 E7 1 47 C 83 2D 6C E 73 23
6C AE 73 823 A2 A9 FE C2 E7 C1 547 BC 38 2D 6C AE 73 823
[Total Marks: 80]

AE 73 823 A2 A9 FE 2C E7 C1 547 BC 38 32D 6C AE 73 823 A2

73 823 A2 A9 FE 2C2 2E7 C1 547 BC 38 32D 6C AE 73 823 A2
5
5
5
5

20 82 A A FE 2C E C1 54 B 38 32 6 A 73 82 A A
10
10
10
10
10
10
10
10

3A 2A 9F 2C 2E 7C 54 7B C3 32 D6 CA E7 82 3A 2A
Q.P.Code: 21849

2A 9F E2C 2E 7C 15 7B C3 832 D6 CA E7 38 3A 2A 9
9F E2 2E 7C 15 47B C3 83 D6 CA E7 38 23A 2A 9F
E2 C2 7C 15 47 C 83 2D C E 38 23 2A 9F E
C2 E7 1 47 BC 383 2D 6C AE 73 23 A2 9 E2
E7 C1 547 BC 38 2D 6C AE 73 823 A2 A9 FE
C1 54 BC 38 32 6C A 73 82 A2 A9 FE 2C
54 7B 38 32 D6 A E73 82 3A A FE 2C
7B C3 32 D6 CA E7 82 3A 2A 9F 2C 2E
C3 83 D6 CA E7 38 3A 2A 9F E2 2E
83 2D CA E 38 23A 2A 9F E2 C2 7
2D 6C E 73 23 2 9 E2 C2 E7
8 A F C
 8E F6 F2 F6 B4 B0 8 F3 E C7
8E F61 1F2 1F6 B48 8B0 080 0F3B BEE EC7 EFC
F F 1F B B 08 F E C EF C
F6 61F2 21F6 6B4 48B0 008 0F3 3BE EC7 7EF CC 694
1F 1F B 8B 08 0F BE EC EF CC 69 8E

e
c
a
61 21 6B 48 00 0 3B E 7E C 6 48 F6

b
b
b
b
d
b

5-a
4-a
3-a
2-a
F B F C 9 E

Q-6
1F 21F F6B 48B 008 80F 3BE EEC 7EF FCC C69 48E F61 1F2
2 6 4 0 0 3 E 7 6 4 1
F2 1F6 B4 8B0 080 F3 BEE C7 EF CC6 94 8EF F61F F21 F6B
1F B4 8B 08 F3 BE C EF CC 94 8E 61 21 F6 48

Q-1
NB:
1F 6B4 8B 008 0F3 BE EC 7EF CC 694 8E F61 F21 F6 B48 B0
7 F B 0

67643
F6 6B48 8B0 0080 0F3B BEE EC7 EFC CC6 6948 8EF 61F F21F F6B 48B B00 80F
B4 B 08 F3 E C EF C 94 EF 61 21 6B 48 00 80F 3B
6B 8B 00 0F B EC 7E C 69 8E 6 F2 F6 4 B0 80 3 EE
48 0 80 3B EE 7 FC C6 48 F 1F 1F B 8B 0 F BE C
48 B00 080F F3B EE C7E EFC C6 948 EF6 61F2 21F 6B4 48B 008 80F3 3BE EC 7EF
B C 9 E 6 0 7
8B 008 80F 3BE EEC 7EF FCC C69 48E F61 1F21 1F6 B48 8B0 080 0F3B BEE EC7 EFC CC6
3 4
00 0F B EC 7E C 69 8E F6 F2 F6 B4 B0 080 F3 EE C7 EF C 94
80 3B EE 7 FC C6 48 F 1F 1F B 8B 08 F BE C EF CC 69 8E
F3 E C7 EF C 94 EF 61 21 6B 48 00 0F 3B E 7E C 69 48 F6

writers problem.
three frame size).
BE EC EF CC 69 8E 61 F2 F6 48 B0 80 3B EE C7 FC C6 48 EF 1F
Duration: 3hours

EC 7E CC 69 48E F6 F2 1F6 B4 B0 080 F3 EE C7 EF C6 94 EF 61F 21F

Explain Thrashing.

(c) System Calls

7E FC 69 48E F6 1F2 1F6 B4 8B0 08 F3 BE C7 EF CC 94 8EF 61F 21 6B
FC C6 48 F6 1F 1F B4 8B 08 0F3 BE EC EF CC 694 8E 61 21 F6 48

P4
P3
P2
P1
P0
C6 948 EF 1F 21F 6B 8B 00 0F BE EC 7E CC 69 8E F61 F2 F6 B4 B0
94 EF 61F 21 6B 48 00 80F 3B EC 7E FC 69 48E F6 F2 1F B4 8B 08
8E 61 2 F6 48 B0 80 3B EE 7 FC C6 48 F 1F 1F 6B 8B 00 0F
Attempt any FOUR

F6 F2 1F6 B4 B0 08 F3 E C7 EF C 94 EF 61 21 6B 48 00 80F 3B
1F 1F B 8B 08 0F BE EC EF CC 69 8E 61 F2 F6 48 B0 80 3B EE
21 6B 48 00 0F 3B EC 7E C 69 48E F6 F2 1F B4 B 08 F3 E C7
F6 48 B0 80 3B EE 7 FC C6 48 F 1F 1F 6B 8B 00 0F BE EC E

(b) Process State transition

Write short notes on: (any two):
B4 B 08 F3 E C EF C 94 EF 61 21 6B 48 00 80F 3B E 7E FC
(3) Assume data if required

(a) Linux Virtual File system

8B 008 0F BE EC 7EF CC 69 8E 61 F21 F6 48 B0 80 3B EE C7 FC C6
00 0F 3B EC 7E C 69 48E F6 F2 F6 B4 B0 080 F3 EE C7 EF C 94
Discuss various scheduling criteria.

80 3B EE 7 FC C6 48 F 1F 1F B 8B 08 F BE C EF CC 69 8E
F3 E C7 EF C 94 EF 61 21 6B 48 00 0F 3B E 7E C 69 48 F6
(1) Question no. 1 is compulsory.

BE EC EF CC 69 8E 61 F2 F6 48 B0 80 3B EE C7 FC C6 48 EF 1F

Allocation
EC 7E CC 69 48E F6 F2 1F6 B4 B0 080 F3 EE C7 EF C6 94 EF 61F 21F

0 5 1 0
3 1 2 1
2 2 1 0
3 0 1 4
A B C D

4 2 1 2

1. FCFS 2. SSTF 3. LOOK 4. SCAN

a) CPU utilization and response time
7E FC 69 48E F6 1F2 1F6 B4 8B0 08 F3 BE C7 EF CC 94 8EF 61F 21 6B
FC C6 48 F6 1F 1F B4 8B 08 0F3 BE EC EF CC 694 8E 61 21 F6 48
C6 948 EF 1F 21F 6B 8B 00 0F BE EC 7E CC 69 8E F61 F2 F6 B4 B0
94 EF 61F 21 6B 48 00 80F 3B EC 7E FC 69 48E F6 F2 1F B4 8B 08
8E 61 2 F6 48 B0 80 3B EE 7 FC C6 48 F 1F 1F 6B 8B 00 0F
F6 F2 1F6 B4 B0 08 F3 E C7 EF C 94 EF 61 21 6B 48 00 80F 3B

6
4
3
3
5
1F 1F B 8B 08 0F BE EC EF CC 69 8E 61 F2 F6 48 B0 80 3B EE
21 6B 48 00 0F 3B EC 7E C 69 48E F6 F2 1F B4 B 08 F3 E C7
F6 48 B0 80 3B EE 7 FC C6 48 F 1F 1F 6B 8B 00 0F BE EC E
Define Operating System. Brief the Functions of OS.

B4 B 08 F3 E C EF C 94 EF 61 21 6B 48 00 80F 3B E 7E FC

which algorithm makes most efficient use of memory?

8B 008 0F BE EC 7EF CC 69 8E 61 F21 F6 48 B0 80 3B EE C7 FC C6

3 2
6 1
3 2
2 1
1 1
Max
Explain Shell. Explain use of chmod command in linux.

B C
00 0F 3B EC 7E C 69 48E F6 F2 F6 B4 B0 080 F3 EE C7 EF C 94
80 3B EE 7 FC C6 48 F 1F 1F B 8B 08 F BE C EF CC 69 8E

5
2
1
1
7
F3 E C7 EF C 94 EF 61 21 6B 48 00 0F 3B E 7E C 69 48 F6
(2) Attempt any three out of remaining five questions.

_________________
BE EC EF CC 69 8E 61 F2 F6 48 B0 80 3B EE C7 FC C6 48 EF 1F
b) Average Turnaround time and maximum waiting time

EC 7E CC 69 48E F6 F2 1F6 B4 B0 080 F3 EE C7 EF C6 94 EF 61F 21F

not system is in safe state. If yes determine the safe sequence.
7E FC 69 48E F6 1F2 1F6 B4 8B0 08 F3 BE C7 EF CC 94 8EF 61F 21 6B
FC C6 48 F6 1F 1F B4 8B 08 0F3 BE EC EF CC 694 8E 61 21 F6 48

disk arm moves for following by applying following algorithms?

C6 948 EF 1F 21F 6B 8B 00 0F BE EC 7E CC 69 8E F61 F2 F6 B4 B0

C6948EF61F21F6B48B0080F3BEEC7EFC
94 EF 61F 21 6B 48 00 80F 3B EC 7E FC 69 48E F6 F2 1F B4 8B 08
8E 61 2 F6 48 B0 80 3B EE 7 FC C6 48 F 1F 1F 6B 8B 00 0F
F6 F2 1F6 B4 B0 08 F3 E C7 EF C 94 EF 61 21 6B 48 00 80F 3B
1F 1F B 8B 08 0F BE EC EF CC 69 8E 61 F2 F6 48 B0 80 3B EE
21 6B 48 00 0F 3B EC 7E C 69 48E F6 F2 1F B4 B 08 F3 E C7
F6 48 B0 80 3B EE 7 FC C6 48 F 1F 1F 6B 8B 00 0F BE EC E
Paper / Subject Code: 40505 / Operating System

B4 B 08 F3 E C EF C 94 EF 61 21 6B 48 00 80F 3B E 7E FC
Differentiate between monolithic, layered and microkernel structure of OS.

Available

0 3 0 1
8B 008 0F BE EC 7EF CC 69 8E 61 F21 F6 48 B0 80 3B EE C7 FC C6
A B C D

00 0F 3B EC 7E C 69 48E F6 F2 F6 B4 B0 080 F3 EE C7 EF C 94
80 3B EE 7 FC C6 48 F 1F 1F B 8B 08 F BE C EF CC 69 8E
F3 E C7 EF C 94 EF 61 21 6B 48 00 0F 3B E 7E C 69 48 F6
Discuss how the following pairs of scheduling criteria conflict in certain settings.

BE EC EF CC 69 8E 61 F2 F6 48 B0 80 3B EE C7 FC C6 48 EF 1F
EC 7E CC 69 48E F6 F2 1F6 B4 B0 080 F3 EE C7 EF C6 94 EF 61F 21F
Describe the differences among short term, medium-term, and long term Scheduling

7E FC 69 48E F6 1F2 1F6 B4 8B0 08 F3 BE C7 EF CC 94 8EF 61F 21 6B

FC C6 48 F6 1F 1F B4 8B 08 0F3 BE EC EF CC 694 8E 61 21 F6 48
Explain the effect of page frame size on performance of page replacement algorithms.

C6 948 EF 1F 21F 6B 8B 00 0F BE EC 7E CC 69 8E F61 F2 F6 B4

94 EF 61F 21 6B 48 00 80F 3B EC 7E FC 69 48E F6 F2 1F B4 8B
8E 61 2 F6 48 B0 80 3B EE 7 FC C6 48 F 1F 1F 6B 8B
F6 F2 1F6 B4 B0 08 F3 E C7 EF C 94 EF 61 21 6B 48 00
1F 1F B 8B 08 0F BE EC EF CC 69 8E 61 F2 F6 48 B0
21 6B 48 00 0F 3B EC 7E C 69 48E F6 F2 1F B4 B 08
F6 48 B0 80 3B EE 7 FC C6 48 F 1F 1F 6B 8B 00
and LRU for given reference string 6, 0, 5, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 5, 2, 0, 5, 6, 0, 5 (assuming
Calculate number of page faults and page hits for the page replacement policies FIFO, Optimal

best fit and worst fit algorithm places the processes of 220k,430k,110k,425k(in order).Evaluate,
Consider the following snapshot of the system. Using Bankers Algorithm, determine whether or

B4 B 08 F3 E C EF C 94 EF 61 21 6B 48 00 80

Given memory partitions of 150k,500k,200k,300k,550k(in order) how would each of the first fit,
Marks: 80

Explain synchronization problem in detail. How counting semaphore can be used to solve readers
8B 008 0F BE EC 7EF CC 69 8E 61 F21 F6 48 B0 80

request at cylinder 143, and the previous request was at cylinder 125. The queue of pending requests
in FIFO is ordered as 80, 1470, 913, 1777, 948, 1022, 1750,130. What is the total distance that the
00 0F 3B EC 7E C 69 48E F6 F2 F6 B4 B0 080 F3
80 3B EE 7 FC C6 48 F 1F 1F B 8B 08 F
F3 E C7 EF C 94 EF 61 21 6B 48 00 0F 3B
5
5
5
5
5

BE EC EF CC 69 8E 61 F2 F6 48 B0 80 3B

20
Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently serving a 10
10
10
10
10
10
10

EC 7E CC 69 48E F6 F2 1F6 B4 B0 080 F3 E

7E FC 69 48E F6 1F2 1F6 B4 8B0 08 F3 BE
FC C6 48 F6 1F 1F B4 8B 08 0F3 BE E
C6 948 EF 1F 21F 6B 8B 00 0F BE EC
94 EF 61F 21 6B 48 00 80F 3B EC
8E 6 2 F 4 B 8 3 E 7