12

14

15

a)
b)

a)
b)

a)

b)

02000CS204052001
PART 0
Answer any two questions. Each carries 9 marks.
Give the solution for dining philosopher’s problem using monitor.

What are the three conditions to be satisfied to ensure solution to critical section
problem?
What is the relevance of mutual exclusion to avoid race condition?

Consider the following set of processes, with the length of the CPU burst time
given in milliseconds

Process Burst time Arrival time

i) Draw Gantt chart to show execution using pre-emptive SJF and Round Robin
(time quantum=3) scheduling.
ii) Calculate average waiting time for each of the above scheduling algorithms.

Consider the following snapshot of a system with five processes 120,121, P2, P3,
P4 and four resources A,B,C and D

| Max | Available
| | ABCD ABCD ABCD
0210 0110 1520

065 2 0632
0656 0014
Using Banker’s algorithm, answer the following questions: -
i) How many instances of resources A, B, C, D are there?
ii) What is the content of Need matrix?

iii) Is the system in a safe state? If it is, find the safe sequence.
PART E

Answer any four questions. Each carries 10 marks.
Consider the following page reference string :
7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0
Indicate page faults and calculate total number of page faults for FIFO algorithm,
assuming that number of frames as three and four. Remember initially all the
frames are empty. Check whether Belady’s anomaly happens.
Does paging suffer from fragmentation? Justify your answer.

Page 2 of 3