Given six memory partitions of 300 kb, 600 kb, 350 kb, 200 kb, 750 kb, and 125 kb (in order, how would the first-fit, best-fit, and worst-fit algorithms place processes of size 115 kb, 500 kb, 358 kb, 200 kb, and 375 kb (in order?

Step-by-step explanation:

first fit:

115 -> 300

500-> 600

358 -> 750

200 -> 350

375 -> not able to allocate  

Best fit:

115 -> 125

500 -> 600

358 -> 750

200 -> 200

375 -> not able to allocate

worst fit:

115 -> 750

500 -> 600

358 -> not able to allocate

200 -> 350

375 -> not able to allocate

step-by-step explanation:

if x = 2 you have to find x to finish the problem

well what you have to do is divide 84 by 6 so theanswer

step-by-step explanation:

84 divided by 6 = 14

and that lightbulb changing party must be freaking lit!