Consider a memory of size 8KB (8192 bytes) that allows dynamic, variable sized partitioning among processes and uses a linked list to keep track of free spaces (hereafter referred to as the free list) in the memory at any given time. Assume that there are 6 processes and assume that their memory size requirements (in bytes) are as given below:

P1: 500, P2: 600, P3: 1300, P4: 2000, P5: 100, P6: 200

Assume that the initial state of the free list is as shown below (BA is the base address and Sz is the size of each free space):

BA: 0; Sz: 1100 BA: 1200; Sz: 600 BA: 2000; Sz: 1800 BA: 6000; Sz 400

For these next questions assume the free list starts in its initial state. Assume that the worst fit policy is used for partition placement. Identify the base address of the region to which each of the following processes will be allocated, assuming that they are allocated in the order specified and show the updated free list state after each allocation. Notes: If the end of the free list is reached while searching for a suitable allocation, the search wraps back to the beginning of the list. If a partition cannot be allocated due to the state of the free list, simply type in the words cannot be accommodated as your answer.

If P4 is allocated, what is the BA?

The updated free list is:

BA: ; Sz: BA: ; Sz: BA: ; Sz: BA: ; Sz

If P2 is allocated, what is the BA?

The updated free list is:

BA: ; Sz: BA: ; Sz: BA: ; Sz: BA: ; Sz

If P6 is allocated, what is the BA?

The updated free list is:

BA: ; Sz: BA: ; Sz: BA: ; Sz: BA: ; Sz

If P1 is allocated, what is the BA?

The updated free list is:

BA: ; Sz: BA: ; Sz: BA: ; Sz: BA: ; Sz