Using the first come-first serve method of allocation, Jobs 1, 2, 3, 4, 5 and 6 have been loaded to the system. The remaining jobs are waiting for their turn in the queue.
Jobs 2, 4 and 6 are now done processing their respective tasks and are now deallocated from the memory. Since there is not enough space in memory to accommodate all incoming jobs, they will have to wait in queue.
Jobs 3 and 5 have finished their jobs and are now deallocated from the memory. Jobs 7 and 8 are loaded and are now beginning to execute their specified jobs. Memory allocated is 195k.
Job 1 has now finished its task and is now deallocated from the memory. Job 9 is loaded onto memory and is now executing its task. Job 10 will have to wait because there is not enough space in the memory to accommodate its size.
Job 8 has now finished its task and is now deallocated from the system. Job 10 is now loaded in the system and is now executing its specified task.
B. Relocatable Dynamic Partition
Jobs 1, 2, 3, 4, 5 and 6 are now loaded in memory and are now executing their respective jobs. The remaining jobs are waiting in queue for their turn.
Jobs 2, 4 and 6 have finished their respective tasks and are now deallocated from the memory. Jobs 1 and 3 are then compacted to accommodate Job 7.
Jobs 3 and 5 are now done executing and they are now deallocated from the memory. Job 8 enters. Job 9 cannot be loaded because when their sizes will be added together, the total size (258k, OS included) will exceed the limit (220k) by 38k.
Job 1 has finished its task in memory and is now deallocated from the system. Job 9 is now loaded into memory and is now executing its assigned task.
Job 8 has now finished its task and is now deallocated from the memory. Job 10 is now loaded into the memory and is now executing.
