December2015 cs Q37
0. Match the following with respect to various memory management algorithms :
| List I | List II |
| (a) Demand paging | (i) degree of multiprogramming |
| (b) Segmentation | (ii) working set |
| (c) Dynamic partitions | (iii) supports user view of memory |
| (d) Fixed partitions | (iv) compaction |
Codes:
| (a) | (b) | (c) | (d) | |
| (1) | (iii) | (iv) | (ii) | (i) |
| (2) | (ii) | (iii) | (i) | (iv) |
| (3) | (iv) | (iii) | (ii) | (i) |
| (4) | (ii) | (iii) | (iv) | (i) |
- Option : D
- Explanation :
- Working set is purest form of page replacement algorithm used in demand paging.
- In segmentation memory is divided into various size chunks to support user view of memory, here memory chunks are allocated to the process.
- Dynamic partition is used for compaction in which allocated objects moving together, and leaving empty space together.
- Fixed partition is dividing memory into fixed size of block for degree of multiprogramming.
So, option (D) is correct.
