Dec, 2001

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

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

1(a) Write an algorithm/program using the file system calls (open, creat, read, write, break, close, unlink) That determines the lenght of a file without using a loop in the code.

(b) Explain the following 3 primary forms of explicit interprocess interaction:
(1) Interprocess synchronization
(2) Interprocess signaling
(3) Interprocesscommunication.

Also discuss the need for Interprocess synchronization.

(c) What is Translation lookaside buffer (TLB)? Describe the functions of TLB in a paging system and also discuss the issues and operations involved in TLB management by the operating system.
2 (a) Explain how �threads� approch improves performance of operating system.

(b) �Any syncronization problem that can be solved with sempaphores can be solved with messages and vice versa�. Explain the reasoning you need to come up with your answer.

3 (a) Discuss the Multiprocessor classification based on Flynn�s caheme. Also mention the advantages of multiprocessor.

(b) Explain the merits and demerits of distributed processing.

4(a) Compare contiguous allocation and Non contiguous allocation with respect to following measures:
(i) Wasted memory
(ii) Time complexity
(iii) Memory Access overhead.

(b) Explain the role of file map table (FMT) in the management of virtual memory.

5 (a) Explain the following with respect to the Disk space management :
(1) Chaining
(2) Indexing.

(b) Explain the Saltzer and Schroeder�s general design principles for protection mechanisms.

6 Write short notes on:
(1) Artifact based Authentication
(2) Hyper cubes
(3) Remote procedure Calls
(4) Distributed shared memory.

Comments are closed.