13.

14.

15.

16.

17.

18.
19.

B4C061S Pages: 2

burst time given in milliseconds.

Process Burst Time

Pl 24

P2 3

P3 3
Schedule the process using Round Robin Scheduling Algorithm. (4.5)
a) Define the difference between Preemtive and non-preemptive scheduling. (4.5)

b) Show that if the wait and signal operations are not executed atomically then mutual
exclusion may be violated. (4.5)
a) Consider the following set of processes that arrive at time 0 with the length of the CPU
burst time given in milliseconds.

Process Burst Time

Pl 6

?2 8

। 7

P4 3
Give the Gantt chart of the process using SJF Algorithm. Also find its average waiting time.

(4.5)

(b) Explain how mutual exlusion is achieved for the producer and consumer processes in

Bounded Buffer Problem? (Use Semaphore) (4.5)
PART E
Answer any FOUR Questions. Each question carries 10 marks.

Discuss the following terms:

(i) Roll out,roll in (ii) External fragmentation (iii) 50-percent rule (10)
Given memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, and 600 KB. How would
each of the First fit Best-Fit and Worst-Fit algorithms place processes of 212 KB, 417 KB,

112 KB, and 426 KB? (10)
Differentiate between Hashed Page Table and Inverted Page Table. (10)
Explain various file operations : (10)

Discuss Protection. What are the main differences between capability list and access list?

(10)

aK

Page 2 of 2