Section 12.2
Review Questions
Virtual memory in action

---

1. What do we call the address in a program where execution begins?

2. What is a victim?

3. What is the name of the most common algorithm for selecting a victim?

4. What extra piece of information does the above algorithm need in conjunction with each frame of real memory, in order to work properly?

5. Why would it be advantageous to run a large program twice?

6. What do we mean when we say a page is dirty?

7. Is it possible for a frame to be dirty?

8. If a computer had 8K of virtual memory, how many address bits would it need?

9. If a computer had 8K of virtual memory, and pages were 512 bytes long, how many pages would there be?

10. Write out in decimal what we mean by the numbers 1K, 4K and 8K.

11. Imagine that you are working with a small system that has 8K of virtual memory and 4K of real memory. Each page is 1K long. How many pages and how many frames would there be?

12. Below is a picture of a small 8K virtual memory address space, along with some memory operations. Next to each, write the page number that the address implies. Also check off the "dirty" column if the page would become dirty by this operation: