a) Out;line the Chandy-Misra-Haas Algorithm to detect deadlock in OR Model

and iilustrate the algorithm with example. U 3

(13)
13.
OR
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
b) Outline Ricart-Agarwala’s Algorithm for implementing mutual exclusion in 3
INTENSIVE COACHING TEST- 2 (UNIT 3&4) R
distributed systems and illustrate the algorithm.. (13)
CS3551– DISTRIBUTED COMPUTING
a) What is checkpointing and why it is needed in distributed system? Illustrate the R
Session : FN algorithm proposed by Juang and Venkatesan for asynchronous 4
Year: I I I /V Section :A checkpointing and recovery.(13)
14.
Time: 3.00 Hours Max Marks : 100 OR
PART A (10×02=20 MARKS) b) What is agreement in failure-free system? Explain how agreement is A 4
reached in message passing synchronous systemswith failures. (13)
Sl. NO Questions Blooms CO
a) Explain about Byzantine Agreement problem and describe about the solution to R 3
1. What is the difference between synchronous and asynchronous R 3 Byzantine Agreement problem(13)
communication in distributed systems? 15. OR
2. What is the role of a "leader election" in a distributed system? U 3
3. R 3 b) Explain about Suzuki-Kasami’s Broadcast algorithm for mutual E 4
Explain the concept of 'message passing' in distributed systems.
exclusion in distributed systems. (13)
4. What are the conditions of Deadlock? R 3
PART C (1×15=15 MARKS)
5. What is Mutual Exclusion? U 3
6. What is the difference between 'failure recovery' and 'fault tolerance' in A 4 a) Outline the Koo and Toueg coordinated checkpointing and recovery technique
distributed systems? and apply this algorithm to a specific case study to demonstrate how this algorithm AP 4
7. Explain the concept of 'Replication' in distributed systems. E 4 avoids the domino effect and live lock problems during the recovery. (15)
8. What is a 'checkpoint' in the context of distributed systems? R 4 OR
9. What is the 'CAP Theorem' in distributed systems? U 4 (i) State Fault Tolerance in Distributed Systems (8)
10. How beneficial is the Chandy-Misra-Haas algorithm in the AND U 4 16 (ii) Explain about Synchronous and Asynchronous communications in
model and OR model. distributed systems. (7)
PART B (5×13=65 MARKS) A 4

a) State the Lamport’s Algorithm and also its uses and also its limitations and U 3
its benefits. Compare this with any two token based algorithms. (13)
11. OR
b) Explain the system models with its preliminaries and how is it
characterised in the model of deadlock. (13) R 3
R- Remembering U-Understanding, Ap- Applying, A- Analyzing, E- Evaluating, C- Creating
a) E x p l a i n t h e f a c t s a s s o c i a t e d w i t h a g r e e m e n t i n
A 4
failure-free systems of both synchronous and
12. asynchronous systems. (13)
OR
b) What are the different checkpointing based recovery systems Ap 4
available? Explain the coordinated checkpointing algorithm with
iilustration. (13)
STAFF INCHARGE HOD PRINCIPAL