JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B.Tech III ADVANCED OPERATING SYSTEMS Previous Question Paper (February - 2022 - R18)

B.Tech | III | III-I | R18 | February - 2022

Answer PaperPaper Code: 155ABMaximum Marks: 75Time: 3 hours

Answer any five questions

All questions carry equal marks

Main

115 marks
a

Explain the design issues in distributed operating system.

8 marks

Answer

The design of a distributed operating system (DOS) involves addressing several fundamental challenges to ensure transparency, efficiency, and reliability across interconnected nodes:

  • Transparency: The system should hide the distributed nature of the hardware and software from the user, providing location, migration, replication, and concurrency transparency.
  • Reliability and Fault Tolerance: Since nodes can fail independently, the system must detect failures and recover gracefully through redundancy, checkpointing, or atomic transactions.
  • Scalability: The architecture must handle growth in the number of nodes or users without significant performance degradation, often requiring decentralized control and avoiding bottlenecks.
  • Communication Models: Choosing between message passing or Remote Procedure Calls (RPC) is critical for inter-process communication, balancing latency and ease of programming.
  • Resource Management: Efficient scheduling and load balancing are required to distribute tasks across nodes to maximize resource utilization.
  • Synchronization and Deadlock: Managing distributed mutual exclusion and preventing deadlocks in a system without global state requires complex algorithms like token passing or logical clocks.
b

Compare vector Vs logical clocks.

7 marks

Answer

Vector clocks and logical clocks (Lamport clocks) are mechanisms used to order events in distributed systems where a global physical clock is unavailable.

FeatureLogical Clocks (Lamport)Vector Clocks
MechanismSingle integer counter per process.Array of integers (one per process).
OrderingProvides partial ordering (if a -> b, then C(a) < C(b)).Provides partial ordering and captures causality (if C(a) < C(b), then a -> b).
CausalityCannot determine if two events are concurrent.Can precisely determine causality and concurrency.
OverheadLow (single integer).High (size proportional to number of processes).

While logical clocks only track the happens-before relationship in one direction, vector clocks provide a complete representation of causal history, allowing the system to detect if two events are concurrent by comparing the vector entries.

215 marks
a

Describe message passing communication model.

8 marks

Answer

Sign in to view the complete answer paper.

b

Explain any one termination detection algorithm.

7 marks

Answer

Sign in to view the complete answer paper.

315 marks
a

Explain the steps to achieve mutual exclusion using token based algorithms.

8 marks

Answer

Sign in to view the complete answer paper.

b

State and explain Shingal’s Mutual exclusion algorithm.

7 marks

Answer

Sign in to view the complete answer paper.

415 marks
a

Explain the properties and performance of Lamport’s Mutual exclusion algorithm.

8 marks

Answer

Sign in to view the complete answer paper.

b

Write Lamport’s algorithm for mutual exclusion.

7 marks

Answer

Sign in to view the complete answer paper.

515 marks
a

Discuss the issues in deadlock detection in distributed systems.

8 marks

Answer

Sign in to view the complete answer paper.

b

Explain edge chasing algorithm for dead lock detection.

7 marks

Answer

Sign in to view the complete answer paper.

615 marks
a

Explain hierarchical deadlock detection algorithm.

7 marks

Answer

Sign in to view the complete answer paper.

b

Explain the deadlock handling strategies in distributed systems.

8 marks

Answer

Sign in to view the complete answer paper.

715 marks
a

Give note on process synchronization in multiprocessor operating system.

8 marks

Answer

Sign in to view the complete answer paper.

b

Describe the architecture of distributed file system.

7 marks

Answer

Sign in to view the complete answer paper.

815 marks
a

Explain full replication algorithms for distributed shared memory.

8 marks

Answer

Sign in to view the complete answer paper.

b

Explain components of load distributing algorithms.

7 marks

Answer

Sign in to view the complete answer paper.

About this paper

This page contains the question paper of ADVANCED OPERATING SYSTEMS from JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD for B.Tech IT III III-I, February - 2022, R18.

For the solved question paper with answers, switch to the Answer Paper tab.

Other papers in ADVANCED OPERATING SYSTEMS

Loading Question Papers

Fetching data from database...