Question

1. Consider six memory partitions of size 200 KB 400 KB, 600 KB, 500 KB, 300 KB
and 250 KB. These partitions need to be allocated to four processes of sizes 357
KB, 210 KB. 468 KB and 491 KB in that order
Perform the allocation of processes using
a) First Fit Algorithm
b) Best Fit Algorithm
c) Worst Fit Algorithm​

Answer 1

Answer:

Explanation:

Explanation: Best fit allocates the smallest block among those that are large enough for the new process. So the memory blocks are allocated in below order.

357 ---> 400

210 ---> 250

468 ---> 500

491 ---> 600

Sot the remaining blocks are of 200 KB and 300 KB