A0

F4
8B
EF

E
Paper / Subject Code: 52771 / Distributed Computing

E9

DA
44
08
4C

A0
8B
EF
A7

9E

F
DA
44
08
4C

0E
FB

8B
EF
A7

9E
A
86

44
8
C

0E
FB
8D

0
4

8B
F
A7

4A
86

E
AB

08
4C
Duration: 3hrs [Max Marks:80]

B
D

B4
94

EF
8

A7

A
86

88
B
43

44
C
A

FB
D

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

4
AF

8B
B8

A7
9

86

E
43
ED
(2) Attempt any three questions out of the remaining five.

8
4C
A

B
D

F0
AF

F
B8

7
E9
(3) All questions carry equal marks.

E
BA
43

8
D

C
A
A0

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

4
F

F
B8

7
E9

DA

39
44

86

E
A

4C
A
A0

FB
8B

D
9E

AF

B8

A7
1 Attempt any FOUR [20]

39
4
08

6
0E
4

D8
D

4A
4

FB
8B
EF
a Explain issues in designing Distributed system

E
4A

AF

8
9

39
8

86
4C

AB
0E
b Compare NOS and DOS

4
0

ED

F4
B
EF

8D
A7

4
88
c Explain desirable features of global scheduling algorithm

E9

DA

39
4

6
C

AB
FB

4
0

D8
4

A0

4
8B
d Explain the need of election algorithm. EF
A7

AF

94
86

B8
E9
44
8
4C

e Justify how Ricart-Agrawala’s algorithm optimized the Message overhead in

B

43
8D

F0

ED

4A
0
8B
F

4A

AF
86

E
AB

achieving mutual exclusion

E9

39
08
C
B
8D

B4

D
4

A0

F4
94

F
7

E
86

8
AB

E9
3

DA
44
08
4C
2 a What is Remote procedure call? Explain how transparency is achieved in RPC [10]
F4

B
D

0
94

B
6F

F
8

9E
DA

4A
CE

88
B

b Explain various forms of message oriented communication with suitable [10]

A
3

8
A

0E
F4

FB
D

B4
F0
9E

4
4

example
B8

7
DA

4A
39

86

CE

8
BA
0E

08
A
F4

B4
9E

74
4A

EF
8
DA

39

3 a What is logical clock? Why are logical clocks required in distributed systems? [10]

88
AB

BA
0E
B4

4C
F4

F0
9E
4A

How Lamport does synchronizes logical clock? Which events are said to be
4

6F
88

B8

A7
A

39

CE
0E
B4
F0

D8
ED

concurrent in Lamports timestamp

4A
4

FB

74
4A

AF
CE

88

8
9

39

b Explain Chandy -Misra_Hass Algorithm for distributed deadlock detection. [10]

86
B

BA
0E
B4
F0

D
74

4A
F4

8D
E
4A
CE

6F
88
A

E9

DA

39

AB
FB

B4
F0

D8

4 a Explain different load estimation and process transfer policies used by load [10]
74

A0

4
E

AF

94
6

CE

88
A

B8
E9

balancing algorithms.
D8

44
FB

43
F0

ED
74

4A
0
B
B8

b Describe code migration issues in details [10]

4A

AF
86

CE

88
A

39
E
FB
8D

B4
F0

ED
74

A0

F4
86

CE

8
B

E9

5 a Discuss and differentiate various client consistency models. [10]

DA
44
08
4A

FB
8D

74

0
B
F

b Explain Absolute ordering and Casual ordering process with the help of example [10]
9E
4A
39

86

88
AB

0E
F4

FB
8D

for many to many communication.

4
F0
74
94

8B
DA

4A
86

CE
AB

BA
43

08
8D

B4
74
AF

94

EF

6 a List desirable features of distributed File system. How are modifications [10]
86

88
AB

BA
43
ED

4C

propagated in file caching schemes?

8D

F0
AF

94

6F

A7
E9

CE
AB

b Discuss Raymonds tree based algorithm of token based in distributed mutual [10]
43

8
ED
A0

FB
D

74
AF

94

exclusion
8
E9
44

86
AB

BA
43
ED
A0

8D
AF

94

6F
E9
4

AB

*********
43
B4

D8
ED
A0

AF

94
8

B8
E9
4
08

43
B4

ED

4A
A0
EF

AF
8

E9

39
4
08
4C

B4

ED
A0

F4
EF

E9

DA
4
08
4C

B4

A0
EF
A7

9E
8

4
08
4C

0E
B

B4

27234 Page 1 of 1
6F

EF
A7

4A
8
D8

08
4C
FB

B4
F
A7
86

CE

88
FB

AB8D86FBA74CEF088B44A0E9EDAF4394
8D

F0
74