RTU Previous Exam Papers BE CSE Eight Semester Distributed Systems May 2011

RTU Previous Exam Papers BE CSE Eight Semester

Distributed Systems May 2011

UNIT-I

1        (a) Explain Distributed System model with suitable examples.

(b) Explain the limitations of Distributed System. Define fundamental models briefly.

OR

1    (a) Define Clock Synchronization in distributed system. What are Logical and Physical Clocks ?

(b) What is Mutual Exclusion ? Differentiate between taken based algorigthm and non-token based algorithm in mutual exclusion.

 

UNIT – II

 

2. (a) Describe mechanism for deadlock detection in distributed system.

(b) Write short notes on :

(i)      Centralized deadlock detection.

(ii)     Distributed deadlock detection.

OR

(a)Explain Edge Chasing Algorithm. Define the role of Atomic commit in Distributed Database System.

(b) Define Byzantine agreement problem with its solution. What do you mean by agreement protocol ?

UNIT-III

(a)  What is Middleware Layer ? Define distributed object model with suitable example.

(b) Define the role of client and server stub procedures in RPC. Explain architecture of distrubuted event notification.

OR

(a)  Describe the role of Digital Signature in Security. Define Digital Signature with Public and Secret Key.

(b) Write the characteristics of File System. Explain Andrew file system with daigram.

UNIT-IV

(a)  What is Locks in Transactions ? Define deadlock in locks with suitable example.

(b) What is Concurrency Control ? Write comparison of methods for Concurrency Control.

OR

 (a)   Explain communication in two-phase commit protocols. Define transaction recovery in distributed transaction.

(b)   What is Replication ? Explain fault tolerant service in replication with example.

UNIT-V

Write short notes on :

(a) Routing Algorithms

(b) Balanced Sliding Window Protocol

OR

(a) What is APP Problem ? Explain Election Algorithm for distributed system.

(b) Explain architecture of CORBA with diagram. Define Defintion Language (IDL) modue for CORBA.

Leave a Comment