Computer Science, asked by fithanazar, 1 month ago

Given five memory partitions of 300Kb, 700Kb, 400Kb, 500Kb, 800Kb (in
order), how would the first-fit, best-fit, and worst-fit algorithms place
processes of 412 Kb, 617 Kb, 112 Kb, and 626 Kb (in order)?

Answers

Answered by harssingh83
0

Answer:

hdjdjdbdnndjdhdndndndmsmdmdkd

Answered by preethikasd
0

Explanation:

I guess this is it! Feel free to correct, if wrong.

Attachments:
Similar questions