Computer Science, asked by mukeshhhkumar7, 6 months ago

if there is a system with the following memory partitions 15KB,25KB,50KB,100KB. Memory requirements (in KB) of processes are: P0(40),P1(15),P2(10),P3(25),P4(18),P5(15). Nature of requests in order is : allocate P0,allocate P1, allocate P2,allocate P3,deallocate P0,deallocate P2,allocate P4,allocate P5. Show the memory layout at intermediate stages for best fit allocation algorithm.

Answers

Answered by shinchen08
0

Answer:

if there is a system with the following memory partitions 15KB,25KB,50KB,100KB. Memory requirements (in KB) of processes are: P0(40),P1(15),P2(10),P3(25),P4(18),P5(15). Nature of requests in order is : allocate P0,allocate P1, allocate P2,allocate P3,deallocate P0,deallocate P2,allocate P4,allocate P5. Show the memory layout at intermediate stages for best fit allocation algorithm.

Explanation:

if there is a system with the following memory partitions 15KB,25KB,50KB,100KB. Memory requirements (in KB) of processes are: P0(40),P1(15),P2(10),P3(25),P4(18),P5(15). Nature of requests in order is : allocate P0,allocate P1, allocate P2,allocate P3,deallocate P0,deallocate P2,allocate P4,allocate P5. Show the memory layout at intermediate stages for best fit allocation algorithm.

Similar questions