第十二周
置换算法¶
1.在请求分页存管理的页表中增加了若干项信息,其中修改位和坊间位供()参考。¶
| 编号 | 选项 |
|---|---|
| A | 程序访问 |
| B | 分配页面 |
| C | 置换算法 |
| D | 调入页面 |
2.LRU page replacement algorithm chooses which of pages to be replaced:¶
| 编号 | 选项 |
|---|---|
| A | the oldest page in memory |
| B | the youngest page in memory |
| C | the page will not be used for the longest period of time |
| D | the page that has not been used for the longest period of time |
3.Linux内存管理子系统采用基于内存区域__算法来管理物理页帧的分配和回收。¶
| 编号 | 选项 |
|---|---|
| A | 伙伴(Buddy) |
| B | slab分配器 |
| C | LRU |
| D | 位示图 |
4.A demanded paging system adopts the LRU page replacement algorithm.Consider a reference string 1 8 1 7 8 2 7 2 1 8 3 8 2 1 3 1 7 1 3 7.Given four initially empty page frames, the total number of page faults is__.¶
| 编号 | 选项 |
|---|---|
| A | 4 |
| B | 5 |
| C | 6 |
| D | 7 |
5.Assume that, the page reference string as 2, 3, 2, 1, 5, 2, 4, 5, 3, 2, 5, 2; the system has 3 frames and all 3 frames are initially empty. LRU replacement will have __ page faults.¶
| 编号 | 选项 |
|---|---|
| A | 9 |
| B | 8 |
| C | 7 |
| D | 6 |
最后更新: 2020-07-02