DEC 2000

Question Paper of CS-13 – Operating Systems of Dec 2000 from IGNOU

Time : 3 Hours
Max. Marks : 75

Note: Question 1 is compulsory.
Answer any three from the rest.

1. (a) Write an algorithm that solves the readers/writers problem using monitors

(b) Devise an algorithm for Dead-lock detection, Discuss the operational aspects of this algorithm

(c) Discuss the common performance measures and optimization criteria that the schedulers use in attempting to maximize system performance.

2. (a) Explain the operations involved in a process switch.

(b) Devise and explain the Dekker’s solution to mutual exclusion problem

3. (a) Compare and contrast the Lamport’s algorithm with Ricart and Agrawala’s algorithm for mutual exclusion in Distributed systems.

(b) Explain why shared-bus multiprocessors are generally regarded as having limited scalability.

4. (a)0 Explain why instruction interpretability is needed in virtual-memory systems. Discuss the issues involved in implementing instruction interruptibility

(b) Explain the address translation in segmented systems.

5. (a) Discuss how the lattice model provides a powerful abstraction that can be used to express a variety of practical security policies.

(b) Explain the following
(i) Digital signatures
(ii) RSA algorithm

6. (a) Describe and discuss the merits of the key advantages of distributed computing claimed by its proponents.

(b) Describe the operation of and discuss the relative advantages and disadvantages of circuit switching, message switching and packet switching.

Comments are closed.