Question

Given six memory partitions of 100 MB, 170 MB, 40 MB, 205 MB, 300 MB, and 185 MB (in order), how would the first-fit, best-fit, and worst-fit algorithms place processes of size 200 MB, 15 MB, 185 MB, 75 MB, 175 MB, and 80 MB (in order)? Indicate which—if any—requests cannot be satisfied. Comment on how efficiently each of the algorithms manages memory

Answer 1

Explanation:

Using First-fit

P2 will be allocated to F1. Therefore, F1 will have a remaining space of 85MB from (100 - 15). P3 will be allocated F5. Therefore, F5 will have a remaining space of 115MB from (300 - 185).