14

15

16

17

18

19

a)
b)
a)

b)
a)

b)

a)

b)
a)
b)
a)
b)

10000CS407122002

PART C

Answer any two full questions, each carries 9 marks.
Differentiate TCP stream communication and UDP datagram communication.
Describe the working of RPC with a neat diagram.
What do you mean by navigation in name resolution?What are the different
types of navigations used in name resolvers?
Describe the architecture of NFS with neat diagram
Why should UFID be unique across all possible file systems? How is uniqueness
for UFID ensured?
Explain the significance and need of external data representation and
marshalling.

PART D

Answer any two full questions, each carries 12 marks.
Describe the significance of locks in distributed transactions.What are the
different types of locks?
Discuss phantom distributed deadlock detection approach.
Write and explain Maekawa’s voting algorithm.
Explain the working of Bully election algorithm with an example..
Compare central server algorithm and ring based algorithm.
Explain how the two-phase commit protocol for nested transactions ensures that
if the top-level transaction commits, all the right descendants are committed or

aborted.

Page 2 of 2

(4)
(5)
(5)

(4)
(5)

(4)

(6)

(6)
(6)
(6)
(6)
(6)