www.nagpurstudents.

org
 B.E. (Computer Science & Engineering) Eighth Semester (C.B.S.)
Distributed Operating System

P. Pages : 2 NIR/KW/18/3690
Time : Three Hours *1347* Max. Marks : 80
_____________________________________________________________________
Notes : 1. All questions carry marks as indicated.
2. Solve Question 1 OR Questions No. 2.

rg
3. Solve Question 3 OR Questions No. 4.
4. Solve Question 5 OR Questions No. 6.
5. Solve Question 7 OR Questions No. 8.
6. Solve Question 9 OR Questions No. 10.

s.O
7. Solve Question 11 OR Questions No. 12.
8. Assume suitable data whenever necessary.
9. Illustrate your answers whenever necessary with the help of neat sketches.

1. a) Define distributed operating system & discuss the designing issues of distributed 7

nt
operating system.

b) What do you mean by cuts of distributed computation? Explain termination detection 7

algorithm.
de
OR

2. a) Describe how vector clock can overcome the limitation of Lamport clock. Consider the 8
tu

following set of events & assign the missing vector logical timestamps to the event.
a=1 b m c d
P1
S

e f g
P2
ur

h=1 n i j k
P3

b) Explain Chandy Lamport's Global state Recording Algorithm. 6

gp

3. a) Explain Raymond's tree based algorithm. 6

b) Justify how Ricart-Agrawala's algorithm achieves mutual exclusion. 7

Na

OR

4. a) Give comparative performance analysis of all Token-based and non token based algorithm. 7

b) Explain Suzuki-Kasami Broadcast algorithm. 6

5. a) Explain Ho-Ramamoorthy centralized deadlock detection algorithm. 7

b) Explain different issues in deadlock detection & resolution. 7

NIR/KW/18/3690 1 P.T.O
 OR

6. a) Explain the classification of agreement problems. 7

b) Explain Edge chasing algorithm for distributed deadlock detection with the help of 7
example.

7. a) Explain the mechanism for building distributed file system. 6

rg
b) Describe the Migration algorithm for implementing distributed shared memory. 7

OR

8. a) Explain with the help of diagram distributed file system architecture. 6

s.O
b) Describe coherence protocols in detail. 7

9. a) Discuss the performance comparision of different load distributing algorithms. 6

nt
b) Explain the concept of load distributing along with sender initiated algorithm. 7

OR
de
10. a) Explain different issues in load distributing. 7

b) Describe the components load distribution algorithms. 6

11. a) What is commit protocol? Explain two phase commit protocol. 7

tu

b) Explain dynamic voting protocols. 6

OR
S

12. a) Describe checkpoint Algorithm in detail. 6

ur

b) Explain the algorithm for site Recovery. 7

gp

**********
Na

NIR/KW/18/3690 2
 www.nagpurstudents.org

The best time to plant a tree was 20 years ago. The second
best time is now.
~ Chinese Proverb
www.nagpurstudents.org
 B.E. (Computer Science & Engineering) Eighth Semester (C.B.S.)
Distributed Operating System

P. Pages : 2 NRJ/KW/17/4746
Time : Three Hours *0168* Max. Marks : 80
_____________________________________________________________________
Notes : 1. All questions carry marks as indicated.
2. Solve Question 1 OR Questions No. 2.

rg
3. Solve Question 3 OR Questions No. 4.
4. Solve Question 5 OR Questions No. 6.
5. Solve Question 7 OR Questions No. 8.
6. Solve Question 9 OR Questions No. 10.

s.O
7. Solve Question 11 OR Questions No. 12.
8. Assume suitable data whenever necessary.
9. Illustrate your answers whenever necessary with the help of neat sketches.

1. a) Explain vector clocks with the help of example. 6

t
b) Differentiate between micro kernel and monolithic kernel approaches for designing a 7

en
distributed operating system. Discuss their relative advantages and disadvantages.

OR

2. a) Discuss in detail various issues in design of distributed operating system. 7

ud
b) What are inherent limitations of a distributed system? Explain. 6

3. a) State and justify how Ricart-Agrawala's algorithm achieves mutual exclusion. 7

St

b) Discuss in detail Raymond's Tree Based algorithm with the help of example. 7

OR
ur

4. a) Give comparative performance analysis of all token-based and non-token based algorithm. 7

b) What are the requirements of mutual exclusion algorithms? Explain. 7

gp

5. a) Explain Chandy-Mishra-Haas's Edge chasing algorithm for distributed deadlock detection 8

with the help of example.

b) Explain deadlock handling strategies in distributed system. 5

Na

OR

6. a) Compare one-phase and two-phase Ho-Ramamoorthy algorithm for deadlock detection. 8

b) Describe AND and OR request models for Distributed Deadlocks, give name of 5
algorithms based on above request models.

7. a) Explain with the help of diagram Distributed file system architecture. 7

NRJ/KW/17/4746 1 P.T.O
 b) Explain following terms related to file system of distributed system: 6

i) Mounting

ii) Caching

iii) Hints

OR

rg
8. a) List and explain various algorithms for implementing distributed shared memory. 8

b) Compare write-invalidate and write-update protocol. 5

s.O
9. a) What are the different issues in Load distributing. 8

b) Discuss mechanism to select a suitable load sharing algorithm. 5

OR

t
10. a) Explain Receiver-Initiated load distributed algorithm with the help of flowchart. 8

b)
en
Describe major components of load distribution algorithms. 5

11. a) Explain the following with help of example: 8

ud
i) Orphan messages and domino effect.

ii) Lost messages.

St

iii) Problem of live lock

b) Explain 2-phase commit protocol. 6

ur

OR

12. a) Explain phases of checkpoint algorithm with the help of diagram. 7

b) Distinguish between static and dynamic voting protocol. 7

gp

*********
Na

NRJ/KW/17/4746 2
 www.nagpurstudents.org

The best time to plant a tree was 20 years ago. The second
best time is now.
~ Chinese Proverb
www.nagpurstudents.org
 B.E. Eighth Semester (Computer Science & Engineering) (C.B.S.)
Distributed Operating System
P. Pages : 2 KNT/KW/16/7608
Time : Three Hours *0345* Max. Marks : 80
_____________________________________________________________________
Notes : 1. Solve Question 1 OR Questions No. 2.
2. Solve Question 3 OR Questions No. 4.
3. Solve Question 5 OR Questions No. 6.

rg
4. Solve Question 7 OR Questions No. 8.
5. Solve Question 9 OR Questions No. 10.
6. Solve Question 11 OR Questions No. 12.
7. Assume suitable data whenever necessary.

s.O
8. Illustrate your answers whenever necessary with the help of neat sketches.

1. a) Define Distributed operating system and what are the advantages of Distributed system. 6

b) Discuss the designing issues of Distributed operating system. 8

t
OR

2. a)
clock.
en
What is the necessity of logical clock? Explain working principle of lamports logical 8

b) What is meant by cuts of distributed computation? What is consistent cut? 6

ud
3. a) Explain Lamport's Algorithm. 7

b) What are the requirements of mutual exclusion algorithm. 6

St

OR

4. a) Explain Raymond's tree-based Algorithm. 7

ur

b) Discuss comparative performance analysis among various mutual Exclusion algorithm. 6

5. a) Discuss deadlock handling strategies in Distributed system. 7

gp

b) What are Agreement protocols? Explain. 6

OR
Na

6. a) Show that Byzantine agreement cannot always be reached among four processors if two 7
processors are faulty.

b) What is deadlock Explain with an example. 6

7. a) What are mechanisms for building Distributed file system. 7

b) Explain memory coherence with an example. 7

OR

KNT/KW/16/7608 1 P.T.O
8. a) What is meant by distributed file system. 7

b) Explain coherence protocols. 7

9. a) What are the issues in load Distributing? 6

b) Explain the concept of load distributing along with Receiver initiated algorithm. 7

OR

rg
10. a) Discuss the various policies of load Distributing algorithm. 8

b) What are the requirements for load distributing? 5

s.O
11. a) What is commit protocol? Explain two phase commit protocol. 7

b) What is Orphan message? Explain. 6

OR

t
12. a) Explain dynamic voting protocols. 7

b) What are the lost messages?

en 6

*******
ud
St
ur
gp
Na

KNT/KW/16/7608 2
 www.nagpurstudents.org

The secret of getting ahead is getting started.

~ Mark Twain
www.nagpurstudents.org
 B.E. (Computer Science & Engineering) Eighth Semester (C.B.S.)
Distributed Operating System

P. Pages : 2 NRT/KS/19/3690
Time : Three Hours *0694* Max. Marks : 80
_____________________________________________________________________
Notes : 1. All questions carry marks as indicated.
2. Solve Question 1 OR Questions No. 2.
3. Solve Question 3 OR Questions No. 4.
4. Solve Question 5 OR Questions No. 6.
5. Solve Question 7 OR Questions No. 8.
6. Solve Question 9 OR Questions No. 10.
7. Solve Question 11 OR Questions No. 12.
8. Due credit will be given to neatness and adequate dimensions.
9. Assume suitable data whenever necessary.
10. Illustrate your answers whenever necessary with the help of neat sketches.

1. a) Explain design issues in distributed operating system. 7

b) What is meant by cuts of distributed compilation? Explain consistent cut. 6

OR

2. a) Explain Lamport logical clock with suitable example. 7

b) What are the limitation of distributed system. 6

3. a) Explain Raymond’s tree – based algorithm. 7

b) What are the requirements of mutual exclusion algorithms? Explain. 7

OR

4. a) Explain Singhal’s Heuristic algorithm. 7

b) State & Explain comparative performance analysis of all token – based and non – token 7
based algorithm.

5. a) Explain path pushing deadlock detection algorithm. 7

b) What are Agreement protocols? Explain it 6

OR

6. a) What are the issues in deadlock detection & Resolution? Explain. 6

b) Explain the classification of agreement problem provide the solution to byzantine 7

agreement problem.

7. a) Explain architecture of distributed file system. 7

NRT/KS/19/3690 1 P.T.O
 b) Explain memory coherence with example. 7

OR

8. a) Explain coherence protocols. 7

b) List and explain various algorithm for implementing distributed shared memory. 7

9. a) Discuss the various policies of load distributing algorithm. 8

b) Describe major components of load distribution algorithm. 5

OR

10. a) State & Explain receiver – initiated algorithm for load distributing. 7

b) Explain Adaptive algorithm for load distribution. 6

11. a) What is commit protocol? Explain two phase commit protocol. 7

b) Explain phases of checkpoint algorithm with the help of diagram. 6

OR
12. a) Explain dynamic voting protocols. 7

b) Explain following with help of example- 6

i) Orphan messages and domino effect.
ii) Problem with live lock.

**********

NRT/KS/19/3690 2
 www.nagpurstudents.org

The secret of getting ahead is getting started.

~ Mark Twain
www.nagpurstudents.org
 B.E. (Computer Science & Engineering) Eighth Semester (C.B.S.)
Distributed Operating System

P. Pages : 2 NJR/KS/18/4746
Time : Three Hours *0619* Max. Marks : 80
_____________________________________________________________________
Notes : 1. All questions carry marks as indicated.
2. Solve Question 1 OR Questions No. 2.

rg
3. Solve Question 3 OR Questions No. 4.
4. Solve Question 5 OR Questions No. 6.
5. Solve Question 7 OR Questions No. 8.
6. Solve Question 9 OR Questions No. 10.

s.O
7. Solve Question 11 OR Questions No. 12.
8. Due credit will be given to neatness and adequate dimensions.
9. Assume suitable data whenever necessary.
10. Illustrate your answers whenever necessary with the help of neat sketches.

nt
1. a) Differentiate between micro kernal and monolithic kernal approaches for designing a 7
distributed operating system. Discuss their relative advantages and disadvantages.

b) What are the limitations of Lamport logical clocks ? Explain vector clocks. 7
de
OR

2. a) What is meant by cuts of distributed computation ? What is consistent cut. 7

tu

b) Explain vector clocks with the help of examples. 7

3. a) State and justify how Ricart - Agrawal's algorithm achieves mutual exclusion. 7
S

b) Discuss in detail Raymonds Tree Based algorithm with the help of example. 6
ur

OR

4. a) State how to analyze performance of mutual exclusion algorithm. 6

gp

b) State and explain Lamport's algorithm. 7

5. a) Explain Chandy - Mishra - Haas's Edge chasing algorithm for distributed deadlock 8
detection with the help of example.
Na

b) Describe AND and OR request model for distributed deadlocks, give name of algorithms 5
based on above request models.

OR

6. a) Explain Ho-Ramamurthy centralized deadlock detection algorithm. 7

b) What are agreement protocols ? Explain in detail. 6

NJR/KS/18/4746 1 P.T.O
7. a) Explain architecture of distributed file system. 7

b) Explain coherence protocols. 6

OR

8. a) What are the design issues in distributed resource management ? Explain. 7

b) Explain following terms related to file system of distributed system. 6

rg
i) Mounting
ii) Caching
iii) Hints

9. a) Explain adaptive algorithm for load distribution. 7

s.O
b) Explain the concept of load distributing along with receiver initiated algorithm. 6

OR

nt
10. a) Explain how task migration effects the performance of load sharing algorithm. 6

b) Discuss mechanism to select a suitable load sharing algorithm. 7

de
11. a) Explain following with help of example - 9
i) Orphan messages and domino effect.
ii) Lost messages
iii) Problem with live lock
tu

b) Explain the characteristics of checkpoint algorithm. 5

OR
S

12. a) Explain with suitable example. 14

ur

i) Commit Protocol

ii) 2 phase commit protocol

gp

iii) Static voting protocol.

***********
Na

NJR/KS/18/4746 2
 www.nagpurstudents.org

High expectations are the key to everything.

~ Sam Walton
www.nagpurstudents.org
 B.E. (Computer Science & Engineering) Eighth Semester (C.B.S.) -
Distributed Operating System
P. Pages : 2 TKN/KS/16/7693
Time : Three Hours *0431* Max. Marks : 80

_____________________________________________________________________
Notes : 1. Solve Question 1 OR Questions No. 2.

rg
2. Solve Question 3 OR Questions No. 4.
3. Solve Question 5 OR Questions No. 6.
4. Solve Question 7 OR Questions No. 8.
5. Solve Question 9 OR Questions No. 10.

.O
6. Solve Question 11 OR Questions No. 12.
7. Due credit will be given to neatness and adequate dimensions.
8. Assume suitable data whenever necessary.

ts
9. Illustrate your answers whenever necessary with the help of neat sketches.
10. Use of non programmable calculator is permitted.

1. a)

b)
en
Explain Issues in Design of a distributed operating system.

What are the limitation of Lamport logical clocks? Explain Vector Clocks.
7

7
ud
OR

2. a) Explain Chandy Lamport's Global State Recording Algorithm. 7

St

b) What are cuts of a distribution computation? Explain Termination detection Algorithm. 7

3. a) What are the requirement of Mutual Exclusion Algorithm? 6

b) Explain Lamport Algorithm for a distributed mutual exclusion. 7

ur

OR

4. a) State how to measure the performance of mutual exclusion algorithm. 6

gp

b) Explain Suzuki – Kasami Broadcast algorithm. 7

5. a) What are the deadlock handling strategies in distributed system. 6

Na

b) Explain Ho – Ramamoorthy centralized deadlock detection algorithm. 7

OR

6. a) What are the issues in deadlock detection and resolution? Explain. 6

b) Explain path pushing deadlock detection algorithm. 7

TKN/KS/16/7693 1 P.T.O
7. a) Explain the mechanism for Building Distributed file system. 7

b) What are the design issues in distributed Resource Management? Explain. 6

OR

8. Explain the Migration algorithm for implementing distributed shared memory. What is 13
memory coherence in distributed shared memory? Explain its forms.

rg
9. a) Explain components of load distribution algorithms. 7

b) Write about Sender Initiated algorithm for load distributing. 6

OR

.O
10. a) What are the requirement for load distribution. 7

ts
b) Explain how Task migration effects. The performance of load sharing algorithm. 6

11. a) Explain how the rolling back of processes can cause problems. 7

b) en
Explain the characteristic of check point algorithm.

OR
7

12. Write short notes on : 14

ud
a) Commit Protocols.

b) Static Voting Protocols.

St

*********
ur
gp
Na

TKN/KS/16/7693 2
 www.nagpurstudents.org

The secret of getting ahead is getting started.

~ Mark Twain