’

PED – 129

*PED129*

II Semester M.E. (Information Technology) Degree Examination, January 2015 (2K13 Scheme) CS – 21 : ADVANCED OPERATING SYSTEMS (Common to CSE/IT/CN/SE/WT/BI) Time : 3 Hours

Max. Marks : 100

Instructions : i) Answer any five full questions. ii) All questions carry equal marks. 1. a) Discuss any two page replacement algorithms in detail.

10

b) Describe the design issues of a distributed operating system in detail.

10

2. a) What are vector clocks ? How are vector clocks implemented ?

10

b) Explain briefly how the messages are casually ordered in Bivman-SchipperStephenson protocol.

10

3. a) Explain Ricart-Agrawala’s algorithm to implement distributed mutual exclusion with an example.

10

b) Discuss Suzuki-Kasami’s broadcast algorithm for distributed mutual exclusion in detail.

10

4. a) Explain Chandy-Misra-Haa’s Edge-Charing Algorithm with an example.

10

b) Discuss both the Hierarchical distributed deadlock detection algorithm in detail.

10

5. a) Explain the oral message algorithm OM (m), where m > o, that solves the Byzantine agreement problem for 3m+1 or more processors in the presence of at most ‘m’ faculty processors. b) Discuss any two applications of Agreement algorithms in detail.

10 10

P.T.O.

*PED129*

PED – 129

6. a) Explain Sender-Initiated algorithm with its merits and demerits.

10

b) Discuss the stable symmetrically-initiated algorithm in detail.

10

7. a) Explain the concurrency control model and the problem of concurrency control for database system.

10

b) Explain various logs with respect to serializability theory. 8. a) Explain with an example the multiversion time-stamp ordering algorithm.

10 10

b) Discuss completely centralized and centralized locking algorithms under concurrency control for fully replicated database system. __________________

10