看板 Grad-ProbAsk 關於我們 聯絡資訊
Given five memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, and 600 KB (in order), how would each of the first-fit, best-fit, and worst-fit algorithms place processes of 253 KB, 463 KB, 132 KB, and 406 KB (in order)?Which algorithm makes the most efficient use of memory? 這題請問有人有答案嗎?謝謝~ -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 220.143.29.210
slowtip:應該是BSET吧? 把process放進去看剩下的記憶體空間最少的 03/16 12:47
kai5566:這題是不是worst-fit和first-fit不能全部放進去呀? 03/17 12:04