DISTRIBUTED COMPUTING
Answer all the Questions.
PART – A (10X2 = 20)
1. Distinguish between message passing system and shared memory system?
2. What are the motivation of distributed computing?
3. Difference between synchronous and asynchronous communication along with
buffering strategy.
4. What are the limitations of logical clock?
5. Define scalar time and vector time.
6. Define global state and consistent global state.
7. If two events e1 and e2 of different processes occur at same time independently. What kind
of relationship exist between e1 and e2?
8. What is casual order in message passing?
9. What is distributed mutual exclusion?
10. Difference between token based and non-token based mutual exclusion algorithm.
PART –B (5X13 = 65)
11.a) Explain message passing system and discuss message oriented middleware and its
types. Explain the functionality in detail
(or)
b) Analyze the concept heterogeneity, openness, security, scalability and impact of
distributed system.
12.a) Explain how motivation influences the design of distributed system and their real world
application
(or)
b) Explain the primitives of Distributed communication
13.a) Describe the physical clock synchronization and logical clock synchronization. Explain the
framework of a system of Logical clock.
(or)
b) Give a real time scenario where FIFO message queue is used. Write and describe the
snapshot algorithm for FIFO channels
14.a) Explain various ways of ordering messages in group communication also illustrate
distributed algorithm to implement total order and casual order of messages.
(or)
b) Compare and contrast Chandy- Misra Haas algorithm for the AND model and OR model.
15. a) Explain with the example of Ricast- Agrawala algorithm with critical section.
(or)
b) Explain the need of distributed system and draw a neat sketch of relation to computer system
components.
PART –C (1X15 = 15)
16.a) Explain the different models of communication network and analyze their impact on
distributed system with an example
(or)
b) Describe snapshot recording algorithm in distributed system and analyze their significance in
global statedetection
Course Outcomes
After successful Completion of the Course, the Students should be able to
CO1 Define what is DC and the methods
CO2 Apply the algorithm to solve the problem
CO3 Analyse the partitioning strategy
CO4 Critically analyze the differentiation of various schema for given problem
CO5 Frame the sketch and suitable methods to solve the problem
Knowledge Level (Blooms Taxonomy)
K Remembering K Understanding K Applying (Application of
1 (Knowledge) 2 (Comprehension) 3 Knowledge)
K K K
Analyzing (Analysis) Evaluating (Evaluation) Creating (Synthesis)
4 5 6
Part Part – A
Question No. 1 2 3 4 5 6 7 8 9 10
Course Outcome CO1 CO1 CO2 CO2 CO3 CO3 CO4 CO4 CO5 CO5
Knowledge Level K1 K1 K1 K2 K1 K1 K2 K1 K1 K1
Part Part – B
14. 14. 15. 15.
11 11. 12. 12. 13. 13.
Question No. (a) (b) (a) (b)
(a) (b) (a) (b) (a) (b)
i,ii
Course Outcome CO1 CO1 CO2 CO2 CO3 CO3 CO4 CO4 CO5 CO5
Knowledge Level K2 K2 K2 K4 K5 K6 K4 K2 K5 K6
Part Part – C
Question No. 16. (a) 16. (b)
Course Outcome CO4 CO5
Knowledge Level K6 K4
