Scribd
Upload
154 views1 page

Aos Question Bank (Unit II)

This document outlines topics to be covered in the second unit of an advanced operating systems course for computer science and engineering students. The unit covers distributed operating systems, including advantages over time-sharing systems, issues in distributed OS, design issues in RPC, limitations of Lamport's clocks, local and global states, requirements for mutual exclusion algorithms, centralized vs distributed control, path-pushing and edge-chasing algorithms, key points in Ho-Ramamoorthy algorithm, Byzantine agreement problem, and impossibility results. Students are asked to write detailed explanations for distributed OS architecture, Lamport's logical clocks, distributed mutual exclusion algorithms, and agreement protocols.

Uploaded by

Suganya Selvaraj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
154 views1 page

Aos Question Bank (Unit II)

This document outlines topics to be covered in the second unit of an advanced operating systems course for computer science and engineering students. The unit covers distributed operating systems, including advantages over time-sharing systems, issues in distributed OS, design issues in RPC, limitations of Lamport's clocks, local and global states, requirements for mutual exclusion algorithms, centralized vs distributed control, path-pushing and edge-chasing algorithms, key points in Ho-Ramamoorthy algorithm, Byzantine agreement problem, and impossibility results. Students are asked to write detailed explanations for distributed OS architecture, Lamport's logical clocks, distributed mutual exclusion algorithms, and agreement protocols.

Uploaded by

Suganya Selvaraj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

CP7204 / ADVANCED OPERATING SYSTEMS


ACADEMIC YEAR: 2013-2014

BATCH: 2013-2015

DEGREE&BRANCH: M.E. & CSE

YEAR / SEMESTER: I / 02
II UNIT
PART - A

1. What are the advantages of Distributed OS over time-sharing systems ?


2. List the issues in Distributed OS.
3. List the design issues in RPC.
4. What is the limitation of Lamports clocks?
5. What is a Local and Global state?
6. What are the requirements of Mutual exclusion algorithm?
7. What is an centralized and distributed control?
8. Define an path-pushing algorithm.
9. What is an Edge-Chasing algorithm?
10. What is the key point in Ho-Ramamoorthy algorithm?
11. What is the Byzantine Agreement problem?
12. Define Impossibility result?
PART-B
1.
2.
3.
4.

Briefly explain Distributed OS with its architecture diagram.


Discuss in detail Lamports logical clocks.

(16)
(16)
(16)
(16)

Explain the distributed mutual exclusion algorithms.


Explain briefly Agreement protocols with suitable examples.

FACULTY INCHARGE

HOD

PRINCIPAL

You might also like