Birla Institute of Technology and Science, Pilani

Distance Learning Programmes Division

MS Software Engineering in Collaboration with Wipro Technologies
First Semester 2008 – 2009
Comprehensive examination
Regular
Course No. : SEWP ZC422
Course Name : Operating Systems
Nature of Exam : Open book Bangalore
Weightage : 60 %
Duration : 3 Hours No of pages :2
Date : December 7, 2008 AN No. of questions :6

Note: Attempt all questions. Start each answer from a fresh page
Q1 a) what is the main advantage of Multiprogramming? Also mention
the major activities of an Operating system with regard to
process Management. (2+3)
Q1 b) Describe the difference among short term, Medium term and
Long term scheduling with Example. (4+1)

Q2 ) Consider the following set of Process with the length of the CPU
burst time given in milliseconds.

Process Burst Time Priority

P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2
The process are assumed to be arrived in P1, P2, P3, P4,P5 order of
all at time 0 .
Draw the Gantt chart to show Execution using FCFS, SJF and
NonPremptive (a smaller priority number implies Higher priority) and
RR (Quantum=1) Scheduling.
Also calculate the Turn around time and waiting time for each of the
Scheduling algorithm. 10.

Q 3 a) Describe the monitor solution to the classical dining

Philosopher problem 5
Q3 b) Consider the following snapshot of the system
Allocation Max Avilable

ABCD ABCD ABCD

P0 0012 0012 1520
P1 1000 1750
P2 1354 2356
P3 0632 0652
P4 0014 0656

a) Using Banker’s Algorithm find the Content of the matrix Need?

b) Is the system in a safe state?
 c)If a request from Process p1 arrives for (0,4,2,0), can the request be granted
immediately? (3+1+1)

Q4 a) Explain the difference between internal and external

Fragmentation. 4
Q4 b) Consider the following page reference string:
1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6
How many page faults would occur in the case of 1)LRU 11)FIFO iii)optimal
replacement assuming 3 frames. Note that initially all frames are Empty.
(2+2+2)

Q 5 a) Explain and Give an Example of an Application in which data in

a file should be accessed in the following Order
i) Sequentially
ii)Randomly 2
Q 5 b) Consider a system that supports the strategies of Contiguous,
linked and Indexed allocation. What criteria should b used in
deciding which strategies is best utilized for a particular file 8

Q 6 suppose that a disk drive has 5000 cylinders numbered 0 to

4999. the drive is currently serving a request at cylinder 143 and
the previous request was at cylinder 125. The queue of pending
requests in FIFO order is

86, 1470, 913, 1774,948,1509,1022,1750,130.

Starting from the current head position, what is the total

distance(In cylinders) That the disk arm moves to satisfy all the
pending requests for each of the following disk scheduling
algorithms?

i)FCFS ii)SSTF ii)SCAN iv)LOOK v)C SCAN 10

****************************