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. FULL ANSWER HERE (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. FULL ANSWER HERE (ii) What is the turn around time and waiting time of each job for the above algorithms?    FULL ANSWER HERE (c) Explain various Multiprocessor Interconnection Networks. FULL ANSWER HERE (d) Differentiate between SCAN and C-SCAN disk scheduling algorithms. Using an example, explain the steps. Also give a brief note on RAID. FULL ANSWER HERE Q2. (a) Explain the structure of Unix and Windows Operating Systems. FULL ANSWER HERE (b) Explain the different approaches for implementing mutual  exclusion in a distributed environment. FULL ANSWER HERE Q3. (a) Characterise deadlock in a system. Using a resource allocation graph, illustrate a deadlock and explain in detail. FULL ANSWER HERE (b) Explain the design goals and design issues involved in a distributed system. FULL ANSWER HERE Q4. (a) Describe memory management in Windows 2000. FULL ANSWER HERE (b) Explain various schemes used for defining the logical structure of a directory. Describe the directory structure of Unix.             FULL ANSWER HERE Q5. (a) Differentiate between the following: FULL ANSWER HERE (i) Internal and External Fragmentation. FULL ANSWER HERE (ii) Demand paging and Demand segmentation FULL ANSWER HERE (iii) Fixed and Variable partition  FULL ANSWER HERE (iv) First fit, Best fir and Worst fit FULL ANSWER HERE (b) Explain Take-Grant Model for security and protection of an operating system. FULL ANSWER HERE]]>

Leave a Reply

Your email address will not be published. Required fields are marked *

15 − fourteen =