Explain the difference between internal and external fragmentation.
Given memory partitions of 100K, 500K, 200K, 300K, and 600K (in order), how would each of the First-fit, Best-fit, and Worst-fit algorithms place processes of 212K, 417K, 122K, and 426K (in order)? Which algorithm makes the most efficient use of memory?
Consider a logical address space of eight pages of 1024 words each, mapped onto physical memory of 32 frames.
Consider a paging system with the page table stored in memory.
Explain why it is easier to share a reentrant module using segmentation that it is to do so when pure paging is used.
A minicomputer uses the buddy system for memory management. Initially it has one block of 256k at address 0. After successive requests for 5k, 25k, 35k, and 20k come in how many blocks are left and what are their sizes and addresses?
Last modified November 8, 01 by firstname.lastname@example.org