Memory holds only a few pages of a program; the rest wait on disk. When a page is needed and memory is full, one page must go. Each policy is a different guess at which page won’t be needed soon, and the number of faults (trips to disk) is the price of guessing wrong.