MU Information Technology (Semester 6)
Distributed System
May 2016
Total marks: --
Total time: --
INSTRUCTIONS
(1) Assume appropriate data and state your reasons
(2) Marks are given to the right of every question
(3) Draw neat diagrams wherever necessary


1(a) Explain implementation of sequencial consistency with non replicating migraing blocks strategy.
5 M
1(b) Which .Net components makes .NET platform and language independent? Explain how it works.
5 M
1(c) Explain Parameters passing Semantics in RPC
5 M
1(d) Compare Bully election algorithm with Ring based election algorithm.
5 M

2(a) Name four different distributed deadlock detection algorithms. Explain probe-based distributed deadlock detection algorithm (CMH) with example.
10 M
2(b) Explain RPC communication Protocol.
10 M

3(a) Define Happened-Before relationship. Explain implementation of logical clocks with an example
10 M
3(b) Describe .Net architecture with neat labeled diagram
10 M

4(a) Explain migration in heterogeneous system.
10 M
4(b) Explain desirable features of a good message passing system.
10 M

5(a) Explain with respect to EJB- Roles in EJB and types of Beans.
10 M
5(b) Explain various distributed computing models.
10 M

Write notes on following
6(a) RMI Execution
5 M
6(b) Components of EJB framework
5 M
6(c) Message Buffering in IPC
5 M
6(d) SOA lifecycle.
5 M



More question papers from Distributed System
SPONSORED ADVERTISEMENTS