5 Suppose memory has 256KB, OS use low address 20KB, there is one program sequence: (20)
Prog1 request 80KB, prog2 request 16KB,
Prog3 request 140KB
Progl finish, Prog3 finish;
Prog4 request 80KB, Prog5 request 120kb
Use first match and best match to deal with this sequence
(from high address when allocated)
(1)Draw allocation state when prog1,2,3 are loaded into memory? (5)
(2)Draw allocation state when prog1, 3 finish? (5)
(3)use these two algorithms to draw the structure of free queue after prog1, 3 finish(draw the allocation descriptor information,) (5)
(4) Which algorithm is suitable for this sequence 2 Describe the allocation process? (5)