June, 2002

Question Paper of CS-13 – Operating Systems of June 2002 from IGNOU

Note :The candidates are required to attempt four questions in all.
Q. No.one is compulsory and carries 30 marks.
Q. Nos. two to six carry 15 marks each.

1(a) Explain the drawbacks of Busy-Wait implementation of semaphores. How can we overcome these by using queuing implementation of semaphores? Discuss.

(b) Explain the Rivest, Shamir, Adelman (RSA) public key algorithm.

(c) Explain the anatomy of Disk Address Transaction.

2(a) What is the difference between a program and a process? Explain the four general categories of process states with the help of process state-transition diagram.

(b) Explain the following scheduling algorithms:
(i) Shortest Remaining Time Next (STRN) scheduling
(ii) Time slice scheduling
(iii) Event driven scheduling
(iv) Multiple-level queues scheduling

3(a) Discuss various machine level implementation of mutual exclusions in general and of semaphores in particular. Also discuss suitability and efficiency of these algorithms.

(b) Explain how a monitor can be implemented with semaphores.

4(a) Explain the following common algorithms for selection of a free area of memory for creation of a partition:
(i) First fit
(ii) Best fit
(iii) Worst fit

(b) Write short notes on:
(i) Memory Compaction
(ii) Hierarchical Address Translation Table

5. (a) Explain the following 3 levels of device abstraction and disk storage addressing techniques which are commonly identifiable in implementation of the file management system :
(i) File Relative logical addressing
(ii) Volume Relative logical addressing
(iii) Drive Relative physical addressing

(b) Explain the Biometric authentication mechanism.

6 (a) Explain the Bus oriented systems and Multistage switch based system architectures for multiprocessor interconnections.

(b)Explain the Ricart and Agrawala�s algorithm for distributed processing.

Comments are closed.