Computer Science, asked by dhanudhanraj, 7 months ago

Given memory partitions of 2500KB, 100KB, 500KB, 350KB, and

700KB ( in order), how would each of the first-fit, best-fit and worst-fit

algorithms place processes of 112KB, 317KB, 242KB and 450KB (in

order)? Which algorithm makes the most efficient use of Memory?

Answers

Answered by RAthi21
1

hello!

_____

First fit

212 K is put in 500 K partition.

417 K is put in 600 K partition.

112 K is put in 288 K partition. (New partition 288 K = 500 K - 212 K)

426 K must wait.

Best-fit

212 K is put in 300 K partition.

417 K is put in 500 K partition.

112 K is put in 200 K partition.

426 K is put in 600 K partition.

Worst-fit

212 K is put in 600 K partition.

417 K is put in 500 K partition.

112 K is put in 388 K partition. (600 K - 212 K)

426 K must wait.

Similar questions