[理工] [OS] 98高應大資工
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
→
03/16 12:47, , 1F
03/16 12:47, 1F
推
03/17 12:04, , 2F
03/17 12:04, 2F
討論串 (同標題文章)
完整討論串 (本文為第 1 之 2 篇)：