IGNOU MCS-041 : OPERATING SYSTEMS December, 2017 QUESTION PAPER

Note: Question No.1 is compulsory. Attempt any three questions from the rest.

Q1. (a) Describe the implementation of IPC using shared memory and message passing. Explain with neat diagrams.

(b) Suppose the following jobs arrive for processing at the times indicated. Each job will run the listed amount of time.

(i) Give a Gantt chart illustrating the execution of these jobs, using the non-pre-emptive FCFS and SJF scheduling algorithms.

(ii) What is the turn around time and waiting time of each job for the above algorithms?

(c) Explain various Multiprocessor Interconnection Networks.

(d) Differentiate between SCAN and C-SCAN disk scheduling algorithms. Using an example, explain the steps. Also give a brief note on RAID.

Q2. (a) Explain the structure of Unix and Windows Operating Systems.

(b) Explain the different approaches for implementing mutual exclusion in a distributed environment.

Q3. (a) Characterise deadlock in a system. Using a resource allocation graph, illustrate a deadlock and explain in detail.

(b) Explain the design goals and design issues involved in a distributed system.

Q4. (a) Describe memory management in Windows 2000.

(b) Explain various schemes used for defining the logical structure of a directory. Describe the directory structure of Unix.

Q5. (a) Differentiate between the following:

(i) Internal and External Fragmentation.

(ii) Demand paging and Demand segmentation

(iii) Fixed and Variable partition

(iv) First fit, Best fir and Worst fit

(b) Explain Take-Grant Model for security and protection of an operating system.

HERE YOU GET ANSWERs OF THESE QUESTIONs