Amrita Vishwa Vidyapeetham 2007 M.C.A Operation System Programming - Question Paper

M.C.A (S) MAY 2007
Operation System Programming

Time : 3 hours Maximum : 100 marks
ans any 5 ques..
(5 ? 20 = 100 marks)
All ques. carry equal marks.
1. (a) Explain the desirable characteristics of Operating System.
(b) Explain the structure of Operating System with a diagram.
2. (a) What is Mutual exclusion? explain Peterson’s algorithm for achieving mutual exclusion.
(b) Explain Priority scheduling with an example.
3. (a) Discuss the goals of I/O software.
(b) Explain Deadlock modeling with an example.
4. (a) Explain Multiprogramming with fixed partitions.
(b) Explain any 1 page replacement algorithm with an example.
5. (a) Explain Disk space management in detail.
(b) Explain the role of Cryptography in security.
6. (a) Explain different System calls.
(b) With short notes on device drivers.
7. (a) Explain Segmentation with an example.
(b) Explain Directory structure.
8. A system has subsequent jobs to generate with a processor
JOB 1 2 3 4 5
DURATION 10 1 2 1 5
PRIORITY 3 1 5 4 2
The jobs have arrived in the order 1, 2, 3, 4, 5. obtain the waiting time of every job for the subsequent algorithms.
(a) First Come 1st Served.
(b) Round Robin with a time slice of 1 unit.

Earning:   Approval pending.