首页 > 试题广场 >

Given five memory partitions o

[问答题]
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 212 KB, 417 KB, 112 KB, and 426 KB (in order)? Which algorithm makes the most efficient use of memory?

添加回答
推荐
星辰大海的碎片头像 星辰大海的碎片
a.First-fit:
b.212K is put in 500K partition
c.417K is put in 600K partition
d.112K is put in 288K partition (new partition 288K = 500K - 212K)
e.426K must wait
f.Best-fit:
g.212K is put in 300K partition
h.417K is put in 500K partition
i.112K is put in 200K partition
j.426K is put in 600K partition
k.Worst-fit:
l.212K is put in 600K partition
m.417K is put in 500K partition
n.112K is put in 388K partition
o.426K must wait
In this example, Best-fit turns out to be the best.
发表于 2018-03-23 22:07:15 回复(0)
提交观点

问题信息

操作系统
上传者：星辰大海的碎片
难度：
1条回答 1807浏览

热门推荐

相关试题

扫一扫，把题目装进口袋

求职之前，先上牛客

扫描二维码，进入QQ群

扫描二维码，关注牛客公众号