Madurai Kamraj University (MKU) 2005 M.C.A Operating Systems - Question Paper

OPERATING SYSTEMS
Time: 3 Hours Maximum: 100 Marks

PART A – (8 * five = 40 marks)
ans ALL ques..

1. (a) What is meant by spooling? discuss it with suitable diagram.
Or
(b) Draw the memory layout for a multiprogramming system and discuss.

2. (a) Write a note on Real time system.
Or
(b) provide the need of protection. discuss about I/O protection.

3. (a) explain about Multiple-processor scheduling.
Or
discuss the combined approach to deadlock handling.

4. (a) Write a note on SJF scheduling.
Or
(b) discuss the use of resource allocation graphs in deadlocks.

5. (a) explain about Multiple-partition allocation.
Or
(b) Write a note on overlays.

6. (a) discuss paged segmentation in detail.
Or
(b) explain about LRU algorithm.

7. (a) Write about the file system, file attributes and file operations.
Or
(b) explain about access lists and groups in file protection.

8. (a) Write a note on file manipulation in UNIX.
Or
(b) discuss about the memory management in UNIX

PART B - (5 x 12 = 60 marks)
ans ALL ques..

9. (a) Explain the following:
(i) Buffering
(ii) Time sharing
(iii) Critical part issue.
Or
(b) explain in detail about the following:
(i) Operating system structures (9)
(ii) Process. (3)

10. (a) Consider the subsequent set of processes, with the length of the CPU burst time provided in milliseconds.
Process Burst time
Pt 10
P2 1
Pa 2
P4 1
P5 5
The processes are presumed to have arrived in the order PI, P2, P3, P4, P5 all at time 0.
(i) Draw 4 Gantt charts illustrating the execution of these processes using FCFS, SJF and RR (quantum = 1) scheduling.
(ii) What is the turn around time of every process for every of the scheduling in part (i).
(iii) What is the waiting time of every process for every of the scheduling algorithms in part (i).
Or
(b) discuss in detail about the various methods of handling deadlocks.

11. (a) explain in detail about the allocation algorithms.
Or
(b) discuss demand paging and its performance.

12. (a) discuss the following:
(i) SSTF disk scheduling (4)
(ii) Scan scheduling (4)
(iii) Directory systems. (4)
Or
(b) explain about the following:
(i) Sector queuing (4)
(ii) File operations (4)
(iii) Linked allocation. (4)

13. (a) Write short notes on the subsequent
(i) Programmer interface (6)
(ii) File system. (6)
Or
(b)
(i) Precess management
(ii) I/O system.

Earning:   Approval pending.