B.E. Computers, IT Notes/Solved Question papers Maharashtra, Mumbai

Showing posts with label DC. Show all posts

Wednesday, July 16, 2014

DISTRIBUTED COMPUTING (DC) MAY 2012 COMPUTER SCIENCE SEMESTER 8

Con. 4452-12. (REVISED COURSE) GN-8270
(3 Hours) [Total Marks : 100]

N.B. : (1) Question No. 1 is compulsory.
(2) Attempt any four questions, out of remaining questions.
(3) All questions carry equal marks.
(4) Draw neat diagram wherever required.

1. (a)	Explain Distributed computing systems models with diagram.	10
(b)	Explain desirable features of a good distributed file system .	10
2. (a)	Compare and contrast Mutual Exclusion Algorithms.	10
(b)	Explain Failure handling in message passing.	10
3. (a)	Discuss the Issues in designing Load-balancing algorithm.	10
(b)	Explain communication protocols for RPC.	10
4. (a)	Explain Stateful file servers and Sateless file servers and its advantages.	10
(b)	Write a note on Group communication.	10
5. (a)	Write a note on System oriented names and Human oriented names	10
(b)	Explain the different distributed physical clock synchronization algorithms	10
	with their relative advantages and disadvantages.
6. (a)	Explain various consistency models in DSM.	10
(b)	Explain RPC implementation mechanism.	10
7.	Write short notes on (any four) :-	20
	(a) Thrashing
	(b) Token ring algorithm
	(c) DCOM
	(d) File - Caching schemes
	(e) Process migration
	(f) Naming and security

Tuesday, July 15, 2014

DISTRIBUTED COMPUTING (DC) DECEMBER 2011 COMPUTER SCIENCE SEMESTER 8

Con.6740-11. (REVISED COURSE) MP-5188.

(3 Hours) [Total Marks :-100]

N.B:- (1) Question No.1 is compulsory.
(2) Attempt any four questions out of remaining six questions.
(3) Figures to the right indicate full marks.
(4) All questions carry equal marks.

1. (a) What are the major issues in designing a distributed operating system? [5 Marks]
(b) What are the main similarities and differences between the RPC Model and the ordinary
procedure call model? [5 Marks]
(c) What are the statefull and stateless servers? [5 Marks]
(d) Differentiate: Replication vs Caching. [5 Marks]

2. (a) Explain various forms of message-oriented communication with suitable example. [10 Marks]
(b) Compare processes and threads. Explain user and kernal level threads execution and also the
need of light-weight threads. [10 Marks]

3. (a) What are the different failure that can occur in RPC system? Discuss the solutions for these
failures. [10 Marks]
(b) Compare data centric and user centric consistencies and explain one consistency model of
each type. [10 Marks]

4. (a) Explain desirable features of a good naming system. [10 Marks]
(b) What is CORBA? Explain its architecture and various services provided by it. [10 Marks]

5. (a) Explain distributed algorithm for mutual exclusion. What are the advantages and
disadvantages of it over centralized algorithm? [10 Marks]
(b) Explain main issues in building a DSM system on a network of heterogeneous
machines. [10 Marks]

6. (a) Explain the process of synchronization w.r.t physical and logical clocks. [10 Marks]
(b) Explain lightweight RPC. [10 Marks]

7. Write short notes on any two: - [20 Marks]
(a) Fault Tolerance
(b) Attacks and Security in a Distributed System.
(c) Issues in Designing Load Sharing Algorithms.

Monday, July 14, 2014

DISTRIBUTED COMPUTING (DC) MAY 2011 COMPUTER SCIENCE SEMESTER 8

(3 Hours) [Total Marks :-100]

1. (a) What are the desirable features of an Open Distributed Systems? [10 Marks]

(b) Differentiate between Process and Threads using proper examples. [10 Marks]

2. (a) What are the parameter passing-semantics of RPC? [5 Marks]

(b) What makes a RPC complicated? Discuss the protocols for handling some of the
complicated RPCs. [5 Marks]

protocols which implement these methods. [10 Marks]

3. (a) What are the issues in designing Load Balancing algorithms? [10 Marks]

(b) Explain the different distributed physical clock synchronization algorithms with their relative
advantages and disadvantages. [10 Marks]

4. (a) What are the criteria to be considered for choosing the block size while designing a DSM?

Explain the different replacement strategies of migrating or replicating the blocks from the

cache. [10 Marks]

(b) What is the notion of a context in a name space? Explain the different clustering and context
binding strategies of names. [10 Marks]

5. (a) Describe the different approaches for deadlock detection in DS. [10 Marks]
(b) What do you mean by a Consistency Model? Explain the available consistency models and
the requirements of the system which support them. [10 Marks]

6. (a) What are the probable failures in the message passing form of IPC? With neat diagrams
explain the reliable IPC protocols. [10 Marks]
(b) Describe the different models for organizing threads. Explain the working of a multi-threaded
server. [10 Marks]

7. Write short notes on(any two) :- [20 Marks]
(a) Lightweight RPC
(b) Process Migration in Heterogeneous Systems.
(c) Stateful and stateless file servers.
(d) Ricart Agrawala Algorithm-Merits and demerits.

DISTRIBUTED COMPUTING (DC) DECEMBER 2012 COMPUTER SCIENCE SEMESTER 8

Con. 10254-12. (REVISED COURSE) KR-5238
(3 Hours) [Total Marks : 100]

N.B. : (1) Question No. 1 is compulsory.
(2) Answer any four from the remaining six.

1. (a)	Explain the reasons why use and popularity of distributed systems are rapidly	10
	increasing despite the increased complexity and difficulty of building it.
(b)	Explain how transparency is achieved in remote Procedure Calls.	10
2. (a)	With neat diagrams, explain the failure handling mechanisms for message passing.	10
(b)	Compare stateful and sateless servers.	10
3. (a)	What are the commonly used semantics for ordered delivery of multicast	10
	messages ?
(b)	Define thrashing. What are the methods used for solving thrashing problems ?	10
4. (a)	Explain the distributed algorithm for clock synchronization.	10
(b)	What are the common strategies used for handling deadlocks in distributed	10
	system.
5. (a)	Explain the different Load estimation policies and process transfer policies used by	10
	load balancing algorithms.
(b)	With neat diagrams explain the commonly used ways in which threads of process	10
	are organized.
6. (a)	What are the main approaches to verify the validity of cached data in DFS ?	10
(b)	Compare the characteristics features of system oriented names and Human	10
	Oriented names.
7.	Write short notes on (any two) :-	20
	(a) Distributed Computing Environment (DCE)
	(b) Heterogeneous DSM
	(c) Election algorithms.
	(d) Fault tolerance of DFS.

DISTRIBUTED COMPUTING (DC) DECEMBER 2010 COMPUTER SCIENCE SEMESTER 8

Con.5616-10. GT-8466

(3 Hours) [Total Marks:-100]

N.B. (1) Question No.1 is compulsory.
(2) Attempt any four questions out of remaining six questions.
(3) Assume suitable data wherever required.

1. (a) What are the different goals of distributed system? Explain how these goals are implemented
in distributed system. [10 Marks]
(b) Compare Multi computer systems with Multi processor systems. [10 Marks]

2. (a) Compare NOS and DOS middleware. [10 Marks]
(b) Explain any algorithm designed to provide mutual exclusion in distributed
environment. [10 Marks]

3. (a) Explain the difference between Data Centric consistency and client centric consistency
models. Explain one scheme of each. [10 Marks]
(b) What is transparency? Discuss transparency with respect to distributed system. [10 Marks]

4. (a) What are Totally Ordered multicasting? How Lamport Clock is implemented? [10 Marks]
(b) Explain the code migration and the role of mobile agents. [10 Marks]

5. (a) Explain various forms of message oriented communication with suitable application of
each. [10 Marks]
(b) Explain with example Threads and processes, discuss differences and similarities between
thread and process. [10 Marks]

6. (a) What is Name Resolution? Explain various ways of name resolution. [10 Marks]
(b) What is CORBA? Explain the working of CORBA as middleware. [10 Marks]

7. Write details note on any four:- [20 Marks]
(a) CODA file system.
(b) Mobile Agents.
(c) Message Broker.
(d) Crash and Recovery
(e) peer to peer model as compare to client-server model.

Saturday, July 12, 2014

DISTRIBUTED COMPUTING (DC) MAY 2010 COMPUTER SCIENCE SEMESTER 8

Con.3232-10. AN-3148

(3 Hours) [Total Marks :-100]

N.B: (1) Question No.1 is compulsory.
(2) Attempt any four questions out of remaining six questions.
(3) Figures to the right indicate full marks.

1. (a) What is CORBA? Explain its general architecture. [10 Marks]
(b) Explain RPC mechanism. Explain RPC semanticsin case of failure. [10 Marks]

2. (a) What are the different goals of distributed system? Explain how are these goals implemented
in the distributed system. [10 Marks]
(b) Compare NOS and DOS with suitable diagram. [10 Marks]

3. (a) What is totally ordered multicasting? How Lamport clock is implemented? [10 Marks]
(b) Explain the need for co-ordinator in distributed system. Explain the election
algorithm. [10 Marks]

4. (a) What are the various forms of message oriented communication? Give example of
each. [10 Marks]
(b) Explain attacks and security threats in distributed system. [10 Marks]

5. (a) Explain code migration and role of mobile agents. [10 Marks]
(b) Explain the process of concurrency control using pessimistic and optimistic time stamp
ordering. [10 Marks]

6. (a) What is name resolution? Explain various ways of name resolution. [10 Marks]
(b) Explain distributed algorithm for mutual exclusion. What are the advantages and the
disadvantages of it over centralized algorithms. [10 Marks]

7. Write short notes on:(any two):- [20 Marks]
i) CODA file system
ii) Fault Tolerance
iii) Parameter passing in RMI
iv) NFS file system.

DISTRIBUTED COMPUTING (DC) MAY 2013 COMPUTER SCIENCE SEMESTER 8

Con. 9122-13. (REVISED COURSE) GS-3817
(3 Hours) [Total Marks : 100]

N.B. : (1) Attempt any five questions.
(2) All questions carry equal marks.

1. (a)	Explain Absolute Ordering and Causal Ordering process with the help of	10
	example for many to many communication.
(b)	Explain RPC system model in detail.	10
2. (a)	Discuss the need of the co-ordinator. Also give any one algorithm for	10
	co-ordinator selection.
(b)	What is the difference between strict consistency model and sequential	10
	consistency model ? How sequential consistency model is implemented
	in DSM ?
3. (a)	What is physical clock synchronization ? Explain ant one algorithm in detail.	10
(b)	Explain deadlock avoidance algorithm in a distributed system.	10
4. (a)	How does light weight RPC work in cross domain architecture ?	10
(b)	Discuss file caching for distributed system.	10
5. (a)	Discuss how processes and resources are bound together. How does process	10
	migration take place in Heterogeneous environment ?
(b)	What are the good features of a Distributed File Systems ? Explain file	10
	sharing semantics of it.
6. (a)	Justify the need of stateful and stateless server in RPC management.	10
(b)	How are failures handled in message passing system in distributed systems?	10
7.	Write any two of the following :-	20
	(a) Disributed Transaction Management
	(b) System Oriented Names for Distributed Computing
	(c) Load Balancing Issues
	(d) Distributed System Models.