Mumbai University Question Papers Distrubuted Computing June 2007

Mumbai University question papers

 VIII Sem CSE Examination June 2007

Distrubuted Computing

N.B.(1 ) Question No.1 is compulsory.

(2) Attempt any four questions out of remaining

(3) Assumptions made should be clearly stated.

(4) Figures to the right indicate full marks.

(5) All questions carry equal marks.


.1. (a) What are the goals of a distributed system?

(b) Compare multi computer system with multiprocessor systems.

(c) “What are various services provided to network operating system by middleware for d.esigning a distributed system?


2. (a) What does one understand by an object reference? How is object reference passed as parameter in RMI.

 (b) What are various forms of message-oriented communication? Applications such as E-mail, Chat, Newsgroup, Web-meeting, SMS use which communi.cation modeL

(c) Compare processes and threads. Explain user and Kernel level threads execution and also the need of light weight threads.



3. (a) Explain the problem of distributed commit. Explain Two-phase commit protocol in detail.

(b) “Vector Timestamp mechanism for synchronization is used for capturing causality of events.” Justify the statement by using an example of distributed application which requires such synchronization.

(c) What issues of parameter passing need to be considered while designing marshalling un-marshalling mechanism in RPC/RMI ?


4. (a) What is CORBA? Explain its architecture and various services provided by it. 10

(b) Explain the need of Client Centric consistency models as compared Data Centric 10

consistency models. Explain any 2 client centric models ~ith the along applications which require to use them.


5. (a) Explain distributed algorithm for Mutual Exclusion. What are the advantages and disadvantages of it over centralized algorithm.

(b) Explain the epidemic protocols for update propagation in eventual consistent data store.

(c) Explain CODA File System.


6. (a) Explain failure semantics in RMI.

(b) Explain why weighted reference counting alogrithm is more efficient than simple reference counting.

(c) What are message brokers?

(d) What are the security issues in mobile code.


7. Write ahy four short notes :-

(a) Garbage Collection in distributed system.

(b) Peer to Peer Model as compare to Client-Server Model

(c) Mobile Agents for Code migration

(d) Name resolution in DNS

(e) Distributed Vs. Nested Transactions.

Leave a Comment