Operating System

(a)

The following questions are based on dynamic partitions:

1. Describe one advantage of dynamic partition over fixed partition.
2. Describe one disadvantage of dynamic partition.
3. Is it possible to reduce the effect of the disadvantage stated in 2(a)(ii)? If yes, explain how to reduce it. What additional hardware component is needed to make it work? Explain.

(b)

Given the following information:

Job	Arrival time	CPU cycle
A	0	8
B	2	5
C	3	1
D	5	3
E	8	3
F	10	1
G	11	4

Draw a timeline for each of the process scheduling algorithms showing the time that each job arrives and the order that each is processed. Calculate the turnaround time for each job.

1. First Come First Serve
2. Shortest Job First
3. Shortest Remaining Time
4. Round Robin (using a time quantum of 3, ignore context switching)