We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1
a) What is Snapshot and what are the needs of taking snapshot in distributed
systems? Outline Chandy-Lamport’s Algorithm for snapshot and illustrate the U 2
algorithm. (13) 13. OR DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING b) Explain various ways of ordering messages in group communications. Also 2 INTENSIVE COACHING TEST- 1 (UNIT 1&2) R illustrate distributed algorithm to implement total order and casual order of messages. CS3551– DISTRIBUTED COMPUTING (13) Session : FN a) Give a realtime scenario where FIFO Message queue is used.Write and R 2 Year: I I I /V Section :A describe the Snapshot algorithms for FIFO Channels. (13) Time: 3.00 Hours Max Marks : 100 14. OR PART A (10×02=20 MARKS) b) Describe the physical clock synchronization and logical clock synchronization and A 2 explain the framework of a system of logical clock . (13) Sl. NO Questions Blooms CO a) Explain the types of group communication in the distributed syatem (13) R 1 1. Distinguish between message passing systems and shared memory R 1 systems. 15. OR 2. What are the motivations of the Distributed Systems? U 1 b) Explain the concept of Transparency in distributed systems. Discuss E 2 3. State the diffrences from synchronous and asynchronous R 1 various types of transparency and their significance in building communication along with buffering strategy adapted in both. distributed systems. (13) 4. List the role of shared memory systems. R 1 PART C (1×15=15 MARKS) 5. State the differences between Distributed Computing and Parallel U 1 Computing. a) What is the role of middleware in distributed systems? Explain the types 6. How do you define the Scalar time and Vector time? A 2 AP 2 of middleware and how they help in managing distributed systems. (15) 7. If the two events e1 and e2 of two different processors occurs at same E 2 time, independently.What kind of reletionship exist between e1 and OR e2. 8. Define Global state and Consistent global state. R 2 (i) Explain the key characteristics of a distributed system. (8) 16 (ii) What is the role of communication in distributed systems? Discuss 9. What are the limitations of logical clock. U 2 different communication models. (7) 10. What is the need of Physical clock. U 2 A 1 PART B (5×13=65 MARKS) a) Explain the design issues and challenges in the design of distributed U 1 operating systems. (13) 11. OR b) Explain blocking, non-blocking , synchronous and asynchronous R- Remembering U-Understanding, Ap- Applying, A- Analyzing, E- Evaluating, C- Creating primitives for distributed communication. Also summarize major libraries R 1 and standards for building distributed applications. (13) a) E x p l a i n m e s s a g e p a s s i n g s y s t e m s a n d d i s c u s s o n A 1 the message oriented middleware and its types. 12. Also explain their functionality in distributed computing. (13) OR STAFF INCHARGE HOD PRINCIPAL b) Analyze the concept of heterogeneity, openness, security, scalability Ap 1 impact of distributed systems. How is the standardization of them make them effective. (13)