Total marks: --
Total time: --
INSTRUCTIONS
(1) Assume appropriate data and state your reasons
(2) Marks are given to the right of every question
(3) Draw neat diagrams wherever necessary


1 (a) What is OS? What are the common tasks performed by OS and when they are performed?
7 M
1 (b) Explain turn around time in batch processing system.
6 M
1 (c) Define distribution system. Give the key concepts and techniques used in distributed O.S.
7 M

2 (a) Explain with basic structure used for system generation in configuring and installing supervisor.
7 M
2 (b) Explain with a figure the working of a two layered O.S. structure.
6 M
2 (c) With a neat diagram, explain the working of a micro kernel based O.S.
7 M

3 (a) Define a process. List the different fields of a process control blocks.
6 M
3 (b) Explain the four fundamental states of process with state transition diagram.
7 M
3 (c) What are the advantages of threads over process? Explain kernel level threads.
7 M

4 (a) Explain the working of a buddy system allocator.
6 M
4 (b) Give the comparison of contiguous and non-contiguous memory allocation.
6 M
4 (c) Explain first fit and best fit technique used to perform a fresh allocation from a free list.
8 M

5 (a) Explain what are the functions performed by paging hardware.
6 M
5 (b) What are the functions performed by VM handler? Give the data structure of VM handler.
6 M
5 (c) Consider the page reference string 5,4,3,2,1,43,5,4,3,2,1,5. How many page faults would occur for the following page replacement policies assuming 3 frames?
(i) FIFO (ii) LRU
8 M

6 (a) What are the facilities provided by the file system and the input-output control system?
6 M
6 (b) With a figure explain the working of a linked allocation of disk space.
7 M
6 (c) Explain the interface between file system and IOCS.
7 M

7 (a) With diagram explain the working of a long, medium and short term scheduling in a time sharing system.
10 M
7 (b) For the following given process for scheduling.
Processes P1 P2 P3 P4 P5
Arrival time 0 2 3 4 8
Service time 3 3 5 2 3

Calculate mean turn around time and mean weighted turn around for the (i) FCFS scheduling (ii) Round-Robin scheduling with time slicing (?) for I second.
10 M

8 (a) Explain the primary issues in implementing message passing.
6 M
8 (b) Explain the working of a blocking and non-blocking delivery protocols.
7 M
8 (c) Explain mailboxes. Give the advantages of mailboxes.
7 M



More question papers from Operating Systems
SPONSORED ADVERTISEMENTS