Hindusthan Institute of Management & Computer Studies, Mathura

MCA-II Semester
Operating System (KCA – 203)
Numerical Question:-
1. Suppose that a disk has 5000 cylinders. The drive is currently serving a request at
143 and previous request was at cylinder 125.the queue of pending request in
FIFO order is 80, 1470, 913, 1774,948,1509,1022,1750,130. Calculate the head
movement for FCFS,SSTF, LOOK, C-SCAN
2. Disk request come into the disk driver for cylinder 10, 22, 20, 2, 40, 6 and 38 in
that order. A Seek takes 6 m-sec per cylinder moved. How much seek time is
needed for “elevator Algorithm”?
3. Consider a swapping system in which memory consist of the following hole size
in memory order : 10K,4K,20K,18K,7K,9K,12K and 15k.which hole are taken for
successive request of 12K,10K and 9k for worst case.
4. If an instruction one microsecond and page fault takes an additional ‘n’
microsecond; give a formula for effective instruction time if page fault occur every
‘k’ instruction.
5. If a FIFO page replacement is used with four page frames and eight pages,how
many page fault will occur with the reference string 0,1,7,2,3,2,7,1,0,3 if the four
frame are initially empty.
6. How long does it take to load a 64k program from disk whose average seek time
is 30 m-sec, whose rotational time is 20 m-sec, and whose track is
i) for a 2K page size
ii) for a 4K page size
7. Given memory partition of 100K, 500K, 200K, 300K and 600K (in order). How
would each of first, best fit algorithm places process of 212K, 417K, 112K and
426K (in order)? Which algorithm makes the most efficient use of the memory?
8. Consider a logical address space of eight pages of 2 10 words, each mapped on to a
physical memory of 64 frames
i) How many bits are there in logical address?
ii) How many bits are there in physical address?
9. Consider a following segment table :

Segment Base Length

0 219 600
1 2300 14
2 90 100
3 1327 580
4 1952 96
What is the physical address of the following logical address?
O, 4301, 101, 112, 5003, 4003, 5051, 1003, 600