SVKM's NMIMS

MUKESH PATEL SCHOOL OF TECHNOLOGY MANAGEMENT

\ Programme: B-Tech ( C o m p u t e r ) Year: IV Trimester-XI1

Academic Year : 2012-2013

Subject : Distributed Computing;
Marks:
Date : 26/04/2013 Time :
Durations: 3 hrs.
Final-Examination

Instructions: Candidates should read carefully the instructions printed on the question paper and on the
cover of the answer book, which is provided for their use.

NB:

1. Question No. 1 is compulsory. Out of remaining questions, attempt any 4 .

2. In all, 5 questions to be attempted.
3. All questions carry equal marks.
4. Answers to each new question to be started on fresh page.
5. Figure to the right indicate full marks.
Q.l a) Define Distributed System. Explain the different types of distributed systems. (10)
b) What is decentralized architecture? Explain structured Peer - to - Peer Architecture? (1 0)

4.2 a) Describe precisely what is meant by a scalable system and also explain scalability (1 0)
problems?
b) Write a note on General design issues for server. (10)

Q.3 a) What is Code Migration? What are reasons for migrating code? (1 0)
b) Discuss the architecture of a Message - Queuing System. (iOj
I
4.4 a) List various techniques for resolving flat names. Explain the Distributed Hash Table (1 0)
in detail.
b) What is the significance of synchronization in distributed system? Explain how is it (10)
achieved Lamport's Logical Clocks.

Q.5 a) Define consistency model. Explain different types of data-centric consistency models. (1 0)
b) Explain mghw Decentralized/Distributed algorithms for handling mutual exclusion, (10)
with their advantages and drawbacks.

4.6 a) Explain following Election Algorithms. (1 0)

i. Bully Algorithm
4
ii. Ring Algorithms
b) Explain various Failure models. Discuss briefly the failure masking by redundancy. (10)

4.7 Write a short note on: (Any Two)

a) S!?:\-NFS
b) X-windows
c) Distributed Web based system
d) Authentication
e) Java RMI