7

7
8C
15

A5
9B

E8
Paper / Subject Code: 37476 / Distributed Computing

51

4F

7E
79
C4
7E
1T01876 - T.E. Computer Science and Engineering (Artificial Intelligence and Machine Learning) (Choice Based) (R-19-20 '

15

9B

E8
F8

A
C' Scheme)SEMESTER - VI / 37476 - Distributed Computing

DA

51

7E
79
C4
54
QP CODE : 10028956 DATE: 18/05/2023

7E
A0

9B

E8
11

F8
A

9
E5

C4
96

4
D
Time: 3 hours Max. Marks: 80

7
5
A0

9B
73

F8
DA

1
========================================================================

80

E5

C4
6

54
39
Instructions:

53

B
A7

F8
6A
07

49
EA
1) Only Four question need to be solved.

E5

54
D
8

C
39
3

A0

A7

11
87
2) All question carries equal marks.

F8
5

7
EA

E5
9E

96

54
0D
3) Illustrate your answers with neat sketches wherever necessary.

8
53

73

A7
B7

11
87

A
4) Figures to the right indicate full marks.

EA

80

E5
E

96
49

D
5) Assume suitable additional data, if necessary and clearly state it.

79

A0
73

1
87
8C

A5

DA
B

51
6) All sub-questions of the same question should be grouped together.

0
9E

96
49
4F

38

7E
7E

A0
3
B7
8C
15

A5

07

DA
E8

96
51

49
4F

38
7E
79

A0
Q.1 (a) What are various issues in distributed system? 05

73
7E

C
5

5
B

E8
11

EA

96
Explain minimum 5 issues. Each issue carries 1 mark
DA

49
4F

8
9
5

A0
73
7

87
E

8C
5
(b) Justify how Ricart-Agrawala’s algorithm optimized the Message 05

5
A0

9B
7

EA

80
E

96
A

4F
overhead in achieving mutual exclusion

79
5

C4
96

73
87
7E

15

5
0

9B
73

EA

80
A

9E
A

51

F
80

(c) What are desirable features of global scheduling algorithm.

C4
05
96

54
D

53
B7

87
7E
53

A0
3

F8
(d) Compare process and thread. 05

EA
9E
07

DA

51

49
EA

96

54
8

B7

87
7E

8C
3

0
73

11
87

6A

9E
Q.2 (a) Explain the message communication model transient synchronous, 10
A

49
F
A

E5
9E

54
D
8

B7
E

8C
9

transient asynchronous, persistent synchronous and persistent

3

0
3

7
B7

11
7

A
7

A
8

49
4F
asynchronous in detail.
EA

E5
E

96
49

0D
8

8C
9

15
(b) What is RPC? Explain the working of RPC in detail with the help of 10
53

73

7
B7

7
8C

6A

DA

51
E8

4F
A

80

diagram.
49
4F

7E
E

39
79

15
3

A0
7
8C
15

A5

07

DA
B

51
E8

96
51

49
4F

Q.3 (a) Explain Suzuki-Kasami Broadcast Algorithm of mutual exclusion. 10

8

7E
7E
9

A0
73
7
7E

8C
5

(b) Explain the process of synchronization w.r.t. physical and logical clocks. 10
DA
B

E8
1

EA

96
DA

49
4F

38
79
E5

A0
73
7
8C
15

A5
A0

E8
7

Q.4 (a) Compare Load sharing to Task Assignment and Load balancing 10
80

96
DA

51

9
F

7E
9
C4
96

strategies for scheduling processes in a distributed system.

3

73
7
7E

5
0

9B

E8
73

F8

EA

80

(b) Explain Bully Election algorithm with the help of an example.

A

10
A

1
80

79
5

C4
96

54
D

53
87
7E
53

B
73

EA
A

9E
A

51

49
F

Q.5 (a) Explain in detail different Data centric consistency models. 10

80

96

54
D

B7

87
7E

(b) Explain Maekawa’s algorithm in detail and also specify properties of 10

53

0
3

F8
6A

9E
7

DA

49
EA

Quorum Set.
0

E5

54
8

B7
8C
39
3

A7

11
87

A5

6A
7

49
4F
0

E5
E

Q.6 (a) Write a note on code migration. 10

D
8
E

8C
39
79

5
3

1
87

(b) What are the features of DFS and explain and draw and explain Model
5

10
6A
7

51

4F
EA

0
9E

0D
8

file service architecture.

7E
9

15
3

73
B7

87

A5

DA

51
80
E

96
49

7E
7E
9

A0
73
7
8C

A5

___________________________
DA
B

E8

96
49
F

8
7E
9
54

A0
73
B7
8C

A5
E8

96
49
4F

38
7E
79

73
C
15

5
9B

E8
8

EA

80
51

9
C4
54

53
7

87
7E

9B
1

F8

EA
9E
DA

51

4
4

B7

87
7E

C
15

F8

9E
DA

51

9
C4
54

B7
E
A0

11

F8
DA

49
E5
6

54

8C
39

A0

A7

11
7

4F

28956 Page 1 of 1
80

E5
6

0D
39

15
A7
6A
07

51
0D
38

3807396A0DA7E51154F8C49B79E87EA5
7E
39