BCS515D Model Set 1 Paper
BCS515D Model Set 1 Paper
Note: 1. Answer any FIVE full questions, choosing ONE question from each module.
2. M : Marks L : Bloom’s Level, C : Course Outcomes.
MODULE - 1 M L C
Q1 a. Define Distributed Systems. List and explain the significant 04 L1, CO1
consequences of Distributed Systems. L2
b. Discuss the key challenges in the Distributed Systems. 08 L2 CO1
c. Explain the Reply-Request Protocol used in the Distributed 08 L2 CO2
Systems for process communication.
OR
Q2 a. Discuss the design issues for Remote Procedure Call (RPC). 06 L2 CO2
b. Illustrate the implementation of Remote Procedure Call (RPC) in 06 L2 CO2
a Distributed Systems environment.
c Discuss the implantation of Remote method invocation (RMI). 08 L2 CO2
MODULE - 2
3. a. Review the characteristics of file systems 04 L2 CO3
b. Discuss the key requirements for Distributed File System. 08 L2 CO3
c. Explain the Distributed File Service architecture. 08 L2 CO3
OR
4 a. Explain the followings w.r.t Name Services: (a) Uniform Resource 06 L2 CO3
Identifiers (URIs) and (b) Uniform Resource Locators (URL).
b. What is navigation w.r.t Name Servers? Explain the following 10 L!, CO3
navigations wr.t Name Servers: (a) iterative (b) multicast (c) non- L2
recursive server-controlled and (d) recursive server-controlled.
c. What is Domain Name System? Explain the Domain Name 04 L!, CO3
System with suitable example. L2
MODULE - 3
5 a. Discuss the followings: (a) Clock Skew, (b) Clock Drift and 06 L2 CO4
(c) Coordinated Universal Time.
b. Explain the Cristian’s method for synchronizing clocks. 06 L2 CO4
c. What is a Logical Clock? Explain the Lamport’s logical clock. 08 L1, CO4
L2
OR
6 a. Discuss the followings w.r.t Network Time Protocol: (a) Design 12 L2 CO4
aims and features (b) Modes of NTP server synchronization
b. Explain the Global states and consistent cuts with suitable 08 L2 CO4
example.
Page 1 of 2
BCS515D
MODULE - 4
7. a. Discuss the followings algorithms for mutual exclusion in 12 L2 CO5
Distributed Systems: (a) central server algorithm (b) ring-based
algorithm (c) multicast and logical clocks.
b. What are the properties of Reliable multicast? Explain the 08 L1, CO5
Reliable multicast algorithm. L2
OR
8 a. Explain the Maekawa’s voting algorithm for mutual exclusion in 08 L2 CO5
Distributed Systems.
b. What is an Election algorithm? What are its requirements? 12 L1, CO5
Explain the ring-based election algorithm. L2
MODULE - 5
9 a. Explain the two-phase commit protocol w.r.t distributed 10 L2 CO6
transactions.
b. Discuss the various methods of concurrency control in distributed 10 L2 CO6
transactions.
OR
10 a. Discuss (a) Phantom deadlocks and (b) Edge chasing w.r.t 10 L2 CO6
deadlock in Distributed Systems
b. Explain the following approaches used in the file recovery in 10 L2 CO6
Distributed Systems: (a) Logging and (b) Shadow versions.
Page 2 of 2