Question: Please post the answer as soon as possible. Thanks in advance!! QUESTION 1 [6 MARKS] (a There are nine (9) fixed partitions of different sizes
Please post the answer as soon as possible. Thanks in advance!!

QUESTION 1 [6 MARKS] (a There are nine (9) fixed partitions of different sizes which are 50 KB, 110 KB, 80 KB, 150 KB, 100 KB, 90 KB, 130 KB, 160 KB and 60 KB. There are several jobs needs to be placed in the memory which are (in order): A (60 KB), B (120 KB), C (40 KB), D (30 KB), E (80 KB) and F (100 KB) How would the Next-fit and Worst-fit algorithms place all the jobs into the memory partitions. Partition Size (KB) Next-fit Worst-fit 1 50 2 110 3 80 4 150 - 5 100 6 90 7 130 8 160 9 60 Internal Fragmentation KB KB Unused Partition KE KB
Step by Step Solution
There are 3 Steps involved in it
To place the jobs using the Nextfit and Worstfit algorithms lets go through each step for both metho... View full answer
Get step-by-step solutions from verified subject matter experts
