15

16

17

18

19

b)

b)

a)
b)

a)
b)
a)
b)
a)

b)

52066 Pages: 2

What are the measures to recover from a deadlock?
PART E
Answer any four questions. Each carries 10 marks.

Given six memory partitions of 100KB,500 KB,200 KB,300 KB,600 KB (in
order),how would the first-fit, best-fit and worst-fit algorithms place processes of
size 212KB,417 KB,112 KB,426KB(in order). Rank the algorithms in terms of
how efficiently they use memory.

Consider a logical address space of 64 pages of 1024 words each, mapped onto a
physical memory of 64 frames.

a. How many bits are required in the logical address?

b. How many bits are required in the physical address?

Discuss the concept of Virtual File Systems?

Suppose that a disk drive has 200 cylinders numbered from 0 to 199.The disk is
currently servicing at cylinder 100 and the previous request was at cylinder
120.The queue of pending requests in FIFO order is 23,89,132,42,187.
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 scheduling
algorithms? i)FCFS ii)SSTF iii)SCAN

Which are the different access methods of a file?

What are the different allocation methods of a file?

Discuss the principles of protection?

How access matrix is used as a protection mechanism?

Consider the following segment table:

What are the physical addresses for the following logical addresses?
i. 0,430

1. 1,10
11. 2,500
iv. 3,400

v. 4,112

How is segmentation different from paging?

20 a) Discuss the different aspects of contiguous memory allocation?

b)

Discuss the steps in handling a page fault?

KKK KK

Page 2 of 2

(4)

(5)

(5)

(4)
(6)

(4)
(6)
(3)
(7)
(5)

(5)
(5)
(5)