16

17

18

19

20

a)
b)

a)
b)

a)

b)

a)
b)

02000CS204052001

Consider a simple paging system with 8KB page size and a page table with each
entry of size 4 bytes. Answer the following questions.

(i) How many bits are used for representing the page offset value?

(ii) What is the size of the physical memory (in bytes) that can be addressed?

(iii) Calculate the amount of internal fragmentation for a process of size 20516 8.
(iv) Is it possible to load a process of size 98KB if there are 12 free frames.
Justify your answer.

(v) How many frames are required for storing a process of size 331KB?

Explain the terms (i) Dynamic Loading (ii) Dynamic Linking

Consider a fixed partitioned memory management scheme with fixed partitions
are 1506, 300K, 550K, 400K, 250K and 200K (in order). Five processes are
ready for execution each with memory requirement as P1(240K), P2(120K),
P3(380K), P4(300K) and P5(350K). Write the allocation in each of the following
cases and calculate the internal fragmentation and external fragmentation (if any)
in each case.

(i) First Fit (ii) Best Fit

What are the advantages of indexed allocation of file space?

Explain the techniques used for managing free space in disk.

On a disk with 1000 cylinders numbered 0 to 999. Compute the number of tracks
the disk arm must move to satisfy the entire request in the disk queue. Assume the
last request was at track 350. The queue in FIFO order contains requests for the
following tracks 240,750,630,530,500 and 360. Starting from the current position,
what is the total distance (in cylinders) that the disk arm moves to satisfy all the
pending requests for the following disk scheduling algorithms?
(i) SSTF (ii) LOOK
Write short notes on protection domain.

Differentiate physical formatting and logical formatting of a magnetic disk.

Explain any three techniques used for implementation of access matrix.

Page 3 of 3

10