819

APRIL-MAY 2017 EXAMINATION

I1 B.E. (4YDC) INFORMATION TECHNOLOGY
IT 3851: DISTRIBUTED COMPUTING
Time: 3Hrs. Max. Marks: 70
TOTAL NO. OF QUESTIONS IN THIS PAPER: 5
Note: Attempt all ive questions. Each question has 4 subparts A,B,C and D. Attempt
any one part from A & B and similarly any one from C & D.

Q1 A Explain the challenges faced by the designers of a distributed system. 1

OR
B Define transparency in context to distributed system. State the eight forms 7
of transparencies.

C Explain the following terms with appropriate examples: 7

1. Proxy server and caches.
2. Mobile code.
3. Middleware.
OR
D Describe interaction model and failure model for distribued systems.

1
Q2 A Explain the following terms:
1. External data representation and marshalling.
2. Remote Procedure calling.
3. rmi callback.
OR
play their role in remote 7
B Draw and describe the various components that
method invocation.

C Draw the table representing 'Rmi invocation semantics' and describe the 7

same.
OR
D Write down a Java based calculator application which uses the concept of 7
rmi.

Q3 A Draw the diagram and elaborate about 'File Service Architecture'.

OR
strategies for Name 7
B What is navigation? Write down details of navigation
resolution.

,
 C Draw and explain the 'Sun Network Filesystem Architecture'.
OR
D Write short note on:
1. Andrew file system (AFS).
2. Mount service.
3. Discovery service.

04 A Why do we need 'clock synchronization'? What are the ways of 7

synchronization of physical clocks?
OR
B EXplain any two algorithm used as a solution to 'mutual exclusion'.

CWhat is an 'election'? Explain ring based election algorithm.

OR
D Give detailed
a
description of 'bully' algorithm for conducting an election. 7

Q5.A Describe the following in context to concurrent transactions using 7

appropriate examples:
. Lost update problem
2. Inconsistent retrieval
3. Serial equivalence and conflicting operations
OR
B Explain 'Dirty reads' and 'Premature writes' with examples. Also describe 7
the concept of cascading aborts.

C What the rules for commitment of nested transactions? State the 7

are
advantagcs of nested over flat transaction.
OR
D Elaborate the concept of deadlock, deadlock prevention, deadlock 7
detection and lock timeouts.

* * * k * ****x *** * x ********

 APR-MAY 2015 EXAMINATION
m B.E. (4YDC) INFORMATION TECHNOLOGY 356
IT 3851: DISTRIBUTED COMPUTING
TIME: 3 HRS
Max Marks: 70
Min Marks: 22

: - - - - -

TOTAL NO. OF QUESTIONS IN THISPAPER:5

Note: Attempt all five questions. Each Question has 4 subparts A, B, C, and D. Attempt any one part
fromA&B and similarly any one from C& D.

(a)i What are distributed systems? what are significant advantages and limitations of 4
distributed systems?
ii Explain with the example what could be the impact of absence of global clock and shared 3
memory.
OR
biDraw and explain two main types of architectural model. 4
ii Explain important types of transparencies in distributed system 3

Explain Interaction model and also describe two variants of interaction model. 5
ii Define integrity property of reliable communication. How to overcome security threats? 2
OR
(d)i State the techniques for failure handling in distributed system. 4
ii Explain process control block(PCB) in detail. 3

(a) Consider a simple application where client sends two integer values to a server, which 7
sums the values and returns the sum to the client.
Describe how you would implement the application using Remote method
invocation(RMI). Describe interfaces ,the remote methods, and remote method
invocations in client program.
OR
(biExplain the concept of Remote procedure cal(RPC) with a suitable example. How the 4
stubs help in making an RPC mechanism transparent ?
What do you mean by distributed objects? 3

Provide a block diagram to illustrate the CORBA architecture and also explain CORBA 7
services.
OR
(di Explain an architecture for distributed event notification. 3
Compare and contrast cORBA with remote method invocation(RMI) 4

(aji 1. Give Domain Name System (DNS) tree structure. 4

2. Provide a block diagram to illustrate working of DNS (resolving host to IP).
1. On which port DNS server works ? 3
pagel
 2. which are the
imponant configurat ion files for DNS
3. Which command used to restart dns
server? server?
Servor 3

OR
(b)i Give the architecture of Sun Network File
System (NFS).
1. What are different versions of NFS
Server?
2. What are different used
options in letc/exports file? 4
3. How will
you mount any file system on client machine
4. I am 2
unable to mount a NFS share. How
will you trace out the reason?
(c)i Explain X.500 Directory services.
ii Draw and Explain File Service Architecture. 4

OR
(d) Explain following:
Andrew File System(AFS) 7
Which two software
design characteristics.
component used in AFS implementation.
III. File name space seen
by clients of AFS
IV. Draw System call interception in AFS
Q.4 (a)i What is Election Aigorithms? Suppose that two process detect the faiiure of coordinator 3
simultaneously and both decide to hold an election using bully algorithm. What happens?

ii Difference between Bully algorithm and Ring Algorithm

OR

(b) i "Let us suppose that there is a coordinator process (Pc) and thrcc other prnccacs P,, P, P, 3
in the system. Also assume that requests are granted in first-come, first served order for
which conrdinator maintains the request queue. Suppose Pi sends request for entering in
critical section after that P2 asks for permission to enter in same critical section. Suppose
that while Pi is still in the critical section Pa also sends a request to enter same critical
section. After some time P1 exits the critical section".
Ilustrae the centralized approach for mutual exclusion with suitable diagram and
status of request
queue.
"Let us suppose that there are four processes P, Pa, Pa and Pa. While Pa is in a critical 4
ii
section, P and Pa wants to enter in same critical section. Processes P and P?'s timestamps
6 and 4 respectively."
Illustrate the distributed approach for mutual exclusion:
1. Status when processes Pi and Pa send request messages while Pa is already in
critical section;
2. Status while process P is still in critical section;
3. Status after process P4 exits critical section;
4. Status after process Pz exits critical section.

(c) Consider the following space time diagram for two processes P and P2.

page2
 ei6
es
e23

ei2
eio e20
PROCESsP PRoceSs 2
1. List all pairs of events that are related by happened-before relation.
2. "Suppose each processes P: and P2 have a
counter Ci and C2,
logical clocks". Give the implementation ofrespectively.clocks
The
counters acts as a
using counters. logical
Write the conditions of
logical clocks for ordering an events based the
relation. on
happened-before 3

OR
(d)i What phantom deadlocks ? lustrate the centralized approach for deadlock detection
are
which could detect the 4
ii
phantom deadlocks?
Let us consider WFG- Based
distributed
sites S and S2, and the local WFGs of eachalgorithm
for deadlock detection, there are two 3
site are shown in figure
below.

Site $1 SiteS

1. Give the modified WFGs of two sites after addition

of node Pex.
2. Give Updated local WFG of site S2 after receiving the deadlock detection
message
from site S.

page3
 suitable example.
concurrency" by taking
Explain
"problems of
Q.5 t a i Transaction Model.
Distributed
OR
ii Explain
schedule and Non
Recoverable witn2-PC(Two-
schedule

vith
Two-Phase
the heln.
with
Commie),
exampl
p amp e
Explain
Recoverable
locking) integrate
(b)i and how
2-PL(Two-Phase
What is 2-PL
the help of diagram.
explain with
rdinators)
and coordinators) in two phas
different cases of failures(
participants commt
the
diWrite
protocol Justity
with
the statements wjith ite
its
protocol.
"Three-Phase Commit is non-blocking Working 4

and state transition diagrams. OR

(diExplain Two-phase commit protocol with its working and state transition diagrameConilict
ns.
4
a schedule.
Is this schedule Cona:

transactions and
three
Consider the following
serializable?
write(x)
T1 Read(x)
Read(x) Write(x)
T2 Read(y) write(y)
write(x)
Readly
T3
 MAY JUNE 2014 EXAMINATION
u YEAR BE (4YNC) INFORMATION TECHNOLOGY
IT3851: DSTRIBUTED COMPUTING
[Max. Marks 70
3Hrs.
Min. Marks 22

TOTAL NO.OF QUESTIONS IN THIS PAPER:5

Atte mpt all the questions. From each question attempt either (a) or (b) and similarly either (c)

or((d).
Discuss the terms heterogeneity, openness, scalability and failure handling with respect to(7
distributedsystems. 1, 19
OR
b) Elaborate on the architectural models employed in distributed systems. 1
HP,
Describe the three main standard technological
OR
Discuss the interaction model and failure model.
components on which the web is based.
, 11
y17 7

Define 'external data representatiop', Interface definition language', temote interface' and
Actions g2 1to, OR
Explain in detail the steps involved to enable the invocalion of a remote methodioperaiion
in JAVA RMI. Also write down the steps of howonecanimplement callback. * /t3

Elaborate the roles of various components involved in a RMI. b. 1

OR
Discuss the invocation semantics associated with RMI. P 3 1 muh, ak l n r omd 7
(
Describe the NFS architecture anditsunderlying models. 311
OR
Compare NFS version 3 and NFS version 4

Discuss the terms True Identifier, "Name Space' and 'Mounting'.

OR
) State the Name Space distribution and çomparison of the name servers implementing
nodes at the different layers.
Pvbau&
Discuss any two algorithms for mutuajexclusion. { 136
OR
What do you mean by election? Discuss the ring based election algorithm. ( 113

Bescribe the bully algorithm used for election: ' 11

OR
Explain the concept of Multicast Communication. 4t

Discuss the problems associated with aborting transactions which can occur even in the
presence of serially equivalent executions of transactions. duw uads
OR
g125
Discuss the terms deadlock, deadlock prevention, deadlock detection and the concept of
timeouts. Pau1s1, 1t
USing lock compatibility tauies discuss the conceptI of two version locking and hieiarchic
locks. 4 , S°0
OR
Draw and discuss the states of the coordinator and participantIs in the tiwo phase commit
protocol. a 9a0sas,56
- ---A~---- - X------
 HD2. 30 521
APRIL-MAY 2013 E AMINATION
II B.E. (4YD(:) EXAM
IT-3851: DISTRIBUTTsD COMPUTING

as.] Max. Marks 70

TOTAL NO. OF QUESTIONS IN THIS PAPER:5

question has four parts i.e. (a), (b), (¢).ànd (d). Attempt either (a) or (b) and similarly
) or (d).
What do you mean by distributed system? [02]
State two examples of.distributed system and diferentiate among them. [02
Discuss the components on which the World Wide Web' is based. 031
OR
Discuss the following two terms. 04]
Heterogeneity and Openness
Discuss mobile code and associated security issues with exarnples. [o3]
W hat are the challnges to the design of a scalable distributed system? [04]
Draw well labeled diagram of three 'architectural model types. [03
OR
What are the techniques for dealing with failures in distributed system? [04]
State any three transparency of the distributed system. 03]

State the significance of'Extemal data representation'. [02]

De fine 'Middlewae'and give its examples [02]
HO W muticast messagS provide useful-infrastructure.for constructing distributed 03
.
systenms.
OR
Draw the diagram corresponding to RPC. [02]
State two differences betwcen a 'Local method invocation' and a 'Remote method
02
invocation'.
Wri te brieíly on 'Events and notification' in distributed system. 03)
07]
Discuss the design issues fer RMI.
OR
Witlh appropriate diagram discuss the implementation of RMI 07)

State ihe varioJs tile system modules and their usage. [02)
inte:face' (operations) and idi
ie i3
S t a t e the differences between 'unix file system
seice interface' (opeiations). 02]
EldD orate on the use of 'directory servicc' in the 'Filc servicCe archartre".
OR
im
context to caching in client and he
server computer l03
befine the following tens iri
case of NFS implementation:
Read-ahead
delayed-write
write-through caching 02]
Discss file hand'es' in NFS 02]
translaion?
Vna t do you urderstard by 'path
name

07)
Deir e the following terins
Name resciution

Navigalion
Discovry sevices
 OR
Differentiate between 'hard mounted' and 'soft
Draw the following mounted 'remote file system.
File service architecture 06
NFS architecture
Distribution of processes in AFS
Q.4 (a)
.With appropYiate cliagran discuss the central server algorithm for mutual exclusion. [04]
State any three
difference between central server aDd ring based mutual exclusion 03
algorithm.
OR
) What do you mean by the term 'election' w.r.t. Distributted systems? 02]
Discuss the ring based election
algcrith1n. [05]
Elaborate 'Bully aigorithm' used ifor Election. (07)
OR
Discuss about 'Multicast communication'. O7
.5 JA) Discuss the following associated with concurrently.executing transactions 06
The lost update problem' and The inconsistent retrievals problem.
Define the 'serialy equivalent interleaving'. 101]
OR
(U) Discuss the problems and solutions associated with aborting of.concurrently j07]
executing transactions.
) Draw the lock compatibility table for hierachie: Incks 04]
State three drawbacks of "locking'. 03
OR
(d Discuss.."optimistic concurrency ccrro appro&ch to the serialization of [07)
transactidns.

*y***********
 APRIL-2012 EXAMINATION 213
III B.E. (4YDC) EXAAM
IT-3851: DISTRIBUTED COMPUTING

Max. Marks 100

Min. Pass Marks: 35

TOTAL NO. OF QUESTIÓNS IN THIS PAPER:5

pt all the questions. Attempt.any two parts out of given three parts in each Question.

() What do you mean by "Distributed System"?

(i) Discuss the technological components on which the "Web" is based?
Discuss the following in context to distributed systèm:
Heterogeneity
Openness
Denial of Service Attack

State the "Failure Handling Techpiques" in Distributed system.

u) Write down eight ransparencies associated with Distributed System. 4
What is the utility of Architectural Model?

)- - What is the purpose of Middleware? 2

.
i) Using appropriate diagrams represent the variations in Architectural Models.
S *8

Defir. e the meaning of the terms "Extemal Daia Representation" and 2

"Marshalling"
i What are the various uses of Multicasting? 8

Write a program which uses Java RMI to display a message at the Serve. 8
What do you mean by RMI Cellback? 2

Sate the vtility of IDL in CORBA.

Diagrammaticaliy represent "Remote Method Invocation" and "Locai Metiod 2

Invocation".
Draw the table represening "Fauk Toierance Measures" and "Invocation
Senantics" in RMI
4
Using diagramis represent the folowing:
Role of Proxy and Skelet on in RMi
Role of Clien: and Sever Stub Procedures in RPC

aw ac Explain the File Serace Architecture.

k rom
Di2w the diagram o "Andre: Fib System". A]so differeniate
Network File System

raw the diagram of "Network File System" Aschitecture

L.
 Define the followi g for "Network File System":
Path Name Translation
Mount Sei v ice
Server and Client Caching
Draw the diagram representing different Navigation Techniques.
(i) Write in brief about Domain Name System. 3 3
Cii) Discuss in short, Directory and Discovery services.

Q4 (a) What do you understand by Distributed Mutual exclusion?

Ci) What is meant by clock drift'?
Ci) Discuss the concept of multicast communication?

(b) Using diagram discues "Central Server Algorithm" for Mutual Exclusion.
Elaborate "Ring based algorithm".
State what do you mean by the tern "Election"? 2

(C) Describe Ring Based Election algorithm

5
Ci Using appropriate diagram discuss the "Buly Algorithm".

(a) 0 State the properties ofa Transaction.

Describe the two problems associated with concurrently nunning transations.

(b) C) Discuss-the coneeptof "Dirty read and "Premature writes" 6

What are the rules for commiument of Nested Transactions? 4

(c) i ) . What do you mean by deadlocks?

(1) Define the following: 6

Deadlock prevention
Deadlock Detection
Hierarchic locks 3
i ) Draw the lock compatibility table for "Two version lockinB"
 DEPARTMENT OF INFORMATION TECHNOLOGY
Mid TermI(January 2018)
IT 38501-Distributed Computing
Total Marks: 20
Time: 1 Hr

Q1 Write about
the
following incontext to distributed system.
1. Heterogeneity & Middleware
2. Openness (give example)
differences between:
Q2 State the
1. Synchronous and Asynchronous distributed system
2. Flat and Nested Transaction

3 Explain external data representation and marshalling(give example).

4 State the following types of failures:
1. Crash failure and Fail-stop
2. Omission failure and Arbitary Failure.
in concurrently executing transactions.
Q5 Describe the lost update problem' and its solution
 T6&Cn

DEPARTMENT OFINFORMATION TECHNOLOGCY

Mid Term II (March 2018)
IT 38501-Distributed Computing
Timex 1 Hr.
QWhat is a 'transaction'and state the Total Marks: 20
properties of a transaction.
Q2 Explain the
problems associated with 'aborting of concurrent transaction'. 6
Q3 What do you understand
by the term Deadlock? 2
Q4 What are the rules for
commitment of nested transaction?
Draw the lock
compatibility table for hierarchic locks. 4
 DEPaRTMENT. OF INFORMATION TECHNOLOGY
Mid Term II (Maroh 2017)
IT 3851-Distributed Computing Total Marks: 20
Time: 1 Hr. 4
01 What do you understand by external data representation and marshalling?
method invocation' in java.
the steps for implementation of 'remote
02 Write down w
mutual exclusion'. nhd
Explain any one algorithm usd for'distributed
transactions.
.4Statethe properties associated with
transactions?
of locking' in context to
concurrent
drawbacks
5 What are the
.

TECHNOLOGY
DEPARTMENT OF INFORMÁTION