Computer Science, asked by jayasreelakshmi6201, 1 year 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 panshulo1
1

write the question properly

Similar questions