ADVANCED OPERATING SYSTEMS.pdf - Google Drive

5 downloads 112 Views 58KB Size Report
Page 1 of 2. JEP – 996. II Semester M.E. (CSE/IT/CN/WT/SE/BI) Degree Examination, July 2014. (2K13 Scheme). CS 21 : AD
JEP – 996

*JEP996*

II Semester M.E. (CSE/IT/CN/WT/SE/BI) Degree Examination, July 2014 (2K13 Scheme) CS 21 : ADVANCED OPERATING SYSTEMS Time : 3 Hours

Max. Marks : 100

Instruction : Answer any five full questions, All questions carry equal marks. 1. a) What are the IPC problems and how it is overcome by using Dining Philosopher’s problem ?

10

b) Discuss in detail the design approaches of an operating system.

10

2. a) Explain the principle of Lamports logical clocks with an example. Discuss the conditions satisfied by the logical clocks and the limitations of Lamport’s clock. 10 b) Describe the Huang’s termination detection algorithm with the proof of correctness.

10

3. a) Explain Markawa’s algorithm to implement distributed mutual exclusion in detail.

10

b) Write the Raymond’s tree based algorithm for distributed mutual exclusion with example. 4. a) Discuss with an example Obermark’s path pushing algorithm. b) Explain Diffusion computation based algorithm with an example.

10 10 10

5. a) Show that a Byzantine agreement cannot be reached among three processors when one is faulty. 10 b) Explain the Dolev et.al., algorithm for reaching Byzantine Agreement. 6. a) Explain Receiver-Initiated algorithm with the flow-chart. b) Discuss the load sharing policies in V-system and sprite.

10 10 10 P.T.O.

*JEP996*

JEP – 996

7. a) What is data base operating system ? Explain the requirements of a database operating system in detail. 10 b) State and explain the serializability theorem with an example. Discuss conditions for serializability in DDBS. 8. a) Explain Two-phase locking ? What are its drawbacks and how it can be overcome ? b) Discuss the Kung-Robinson algorithm for optimization under concurrency control.

———————

10 10 10