14

15

16

17

18

19

20

a)

b)

b)
a)
b)
a)
b)

C4808 Pages: 2

Process | Burst time(ms)| Arrival time
0 11 0
1 13 5
2 | 9 |
3 13
4 12 17

What do you mean by deadlock? What are the four necessary conditions for
a deadlock to occur?

Consider a system with four processes P1, P2, P3, P4, and four types of resources
11, 1२2, 1२3, R4. The maximum no: of instances of resources of each type are 5, 7, 7
and 7 respectively. What will be the order of processing of jobs if the allocated
matrix and the maximum claim (that each process can claim) matrix are as given
below.

Allocated Matrix

p2 | 0 | | 0 | 1 2

| ष्टा | 2 | 1 | 3 | 2 | 3 | 5 | 6 | 4
೫3 | 1 | 2 1 1

PART E

Answer any four questions. Each carries 10 marks.
With a diagram, explain how paging is done with TLB.
How is protection done in paging systems?
Differentiate internal fragmentation and external fragmentation.
How is swapping done? Explain with the help of a diagram.
What do you mean by thrashing? How is it caused?
Consider the following page reference string:
7,2,3,1,2,5,3,4,6,7,7,1,0,5,4,6,2,3,0,1.
Assuming demand paging with three frames, how many page faults would
occur for the following page replacement algorithms.

i) LRU replacement 11) FIFO replacement iii) Optimal replacement
The read write head is at 97. The head is moving from 299 to 0. Requests are
in the order 94, 82, 101, 110, 198, 75, 87, 124, 136. How much time is
required by the system if the system is following:

i) Shortest seek time first. ii) C-Scan.

iii) Elevator algorithm. Assume | head movement takes 1 ms.

How is disk formatting done?

Explain sequential access and direct access methods

Explain indexed allocation method with an example diagram
What is the use of access matrix in protection mechanism?

How are bad blocks in disks managed?
oh 2 मं ‏بد‎

Page 2 of 2

(3)

(6)

(6)
(4)
(4)
(6)
(4)
(6)

(6)

(4)
(5)
(5)
(6)
(4)