Semester : SEMESTER 7
Subject : Distributed Computing
Year : 2020
Term : DECEMBER
Branch : COMPUTER SCIENCE AND ENGINEERING
Scheme : 2015 Full Time
Course Code : CS 407
Page:2
14
15
16
17
18
19
a)
b)
a)
b)
a)
b)
a)
b)
a)
b)
a)
b)
10000CS407122003
PART (^
Answer any two full questions, each carries 9 marks.
With a neat diagram, explain the tasks in group membership management.
Explain the request —reply protocol used in client server communication. Give
an example.
Summarize any five Distributed File System requirements.
Explain the role of virtual file system module (VFS) in Sun NFS.
What are the different failures mentioned in the failure model for UDP
datagrams?
With appropriate diagram explain the distribution of processes in the Andrew
File System.
PART 0
Answer any two full questions, each carries 12 marks.
Explain the lost update and inconsistent retrievals problems in concurrent
transactions with the help of examples.
What are the disadvantages of Lock based concurrency control? Name and
explain any alternative approach for achieving concurrency
Describe the working of bully algorithm with an example.
Compare the central server algorithm and ring based algorithm. Which is better
and why?
What are nested transactions? Summarize the rules for committing of nested
transactions
In a ring topology 7 processes are connected with different ID’s as shown:
P20->P5->P10->P18->P3->P4->P9 If process P10 initiates election after how
many message passes will the coordinator be elected and known to all the
processes. What modification will take place to the election message as it passes
through all the processes?
நக்கக்
Page 2of 2
(5)
(4)
(5)
(4)
(4)
(5)
(6)
(6)
(6)
(6)
(6)
(6)