4.1 Bankers Algorithm (Safety Algorithm)

			Available Resource
	Current Allocaton	Maximum Need	A B C	Need to Complete
	A B C	A B C	2 3 1	A B C
P0	1 2 4	6 3 4
P1	1 0 0	6 5 3
P2	1 2 0	1 2 2
P3	2 3 3	3 5 4
P4	3 1 1	4 4 6

Fill in the Need to Complete column

Analyze whether there is a sequence that allows all processes to acquire resources and complete

If there is a sequence to complete list it here:

If there is no sequence to complete, explain why not

4.2 Disk Scheduling: using Shortest Seek-Time First, R/W head starts at track 50.

Sequence is 15, 5, 16, 71, 14, 28, 19, 35, 80, 72, 89, 20

Draw a line diagram with the track requests indicated like the powerpoint slide

Add arrows moving the R/W head to the next track using SSTF scheduling

Count the total head movement.