Rashtrasant Tukadoji Maharaj Nagpur University
Faculty of Science & Technology
Fifth Semester B.Tech. (Computer Science & Engineering (AI & ML) (Computer Science
& Engineering) (Computer Science) (C.B.C.S.) Examination 2025
DISTRIBUTED OPERATING SYSTEM
Elective – III
P. Page: 3 PRS/KS/25/2779
Time-Three Hours [Maximum Marks-70]
INSTRUCTIONS TO CANDIDATES
(1) All questions carry marks as indicated.
(2) Solve Question No. 1 OR Question No. 2.
(3) Solve Question No. 3 OR Question No. 4.
(4) Solve Question No. 5 OR Question No. 6.
(5) Solve Question No. 7 OR Question No. 8.
(6) Solve Question No. 9 OR Question No. 10.
Unit 1
1) Define Distributed Operating System and what are the advantages of Distributed
System?
2) Discuss the designing issues of Distributed Operating System.
3) Explain the architecture of Distributed operating system.
4) Differentiate between microkernel and monolithic Kernal approaches for
designing a distributed operating system. Discuss their relative advantages and
disadvantages.
5) What is meant by cuts of distributed compilation? Explain consistent cut.
6) What is the limitation of distributed system ?
7) Explain the architecture of Distributed Operating System.
8) Differentiate between Distributed OS and Computer Network.
9) Utilize the client-server model in distributed operating systems?
10) Summarize the primary challenges in designing of distributed operating systems?
11) Explain the peer-to-peer model differ from the client-server model?
12) Distinguish between distributed systems and networked systems.
13) Discuss physical model in distributed operating systems?
14) Explain the major goals of a distributed operating system?
Unit 2
1) State & explain Lamport's algorithm for mutual inclusion.
2) What are the requirements of mutual exclusion algorithms ?Explain.
3) Explain Suzuki Kasami's Broadcast algorithm.
4) State and explain Ricart-Agrawal's Algorithm how achieves mutual exclusion.
5) State & explain comparative performance analysis of all token-based and non-
token-based algorithm.
6) State how to analyze performance of mutual exclusion algorithm ?
7) Explain Mackawa's algorithm.
8) Elaborate the Ricart-Agarwala algorithm ensure fairness and prevent deadlock?
9) Justify Lamport's logical clock ensure event ordering in a distributed system?
10) Enlist the advantages and limitations of token-based algorithms compared to
non-token-based algorithms?
11) Elaborate the non-token-based algorithm, and how does it differ from a token-
based algorithm?
12) Justify Ricart-Agarwala algorithm, and how does it achieve mutual exclusion in
distributed systems?
Unit 3
1) What is deadlock ?Explain with an example.
2) Explain Ho-Ramamurthy centralized deadlock detection algorithm.
3) What is deadlock? How it is happened? How to avoid it? Explain with example.
4) Explain path pushing deadlock detection algorithm.
5) Explain different issues in deadlock detection & resolution.
6) What are Agreement protocols? Explain it.
7) Discuss in detail Raymond's Tree Based algorithm with the help of example.
8) Explain Edge chasing algorithm for distributed deadlock detection with the help
of example.
9) Explain the classification of agreement problem provide the solution to byzantine
agreement problem.
10) Explain deadlock in the context of distributed operating systems?
11) Explain the key challenges of deadlock detection in distributed systems?
12) Illustrate deadlock avoidance, and how is it implemented in distributed systems?
13) Discuss the strategies are used to prevent deadlocks in distributed systems?
14) Discuss deadlock handling strategies in distributed system.
15) Explain Chandy-Mishra-Haas's Edge chasing algorithm for distributed deadlock
detection with the help of example.
Unit 4
1) Explain architecture of distributed file system.
2) Explain memory coherence with example.
3) Explain about the algorithm for implementing DSM.
4) What are the mechanisms for Building Distributed file system?
5) Explain with the help of diagram distributed filesystem architecture.
6) What are the design issues in distributed resource management?
7) List and explain various algorithm for implementing distributed shared memory.
8) Explain coherence protocols.
9) Describe the Migration algorithm for implementing distributed shared memory.
10) Explain following terms related to file system of distributed system.
i) Mounting
ii) Caching
iii) Hints
Unit 5
1) State &explain receiver-initiated algorithm for load distributing.
2) Explain Adaptive algorithm for load distribution.
3) Explain the requirements for load distributing task migration.
4) Discuss the performance comparison of different load distributing algorithms.
5) Explain the concept of load distributing along with receiver-initiated algorithm.
6) Discuss the various policies of load distributing algorithm.
7) Describe major components of load distribution algorithm.
8) Explain how task migration effects the performance of load sharing algorithm ?
9) Explain the issues in load distributing.
10) Discuss mechanism to select a suitable load sharing algorithm.
11) Explain the concept of load distributing along with sender-initiated algorithm.
