Written Homework to Hand In, Monday, February 4, 2002.

1. Prove that FIFO is 2-competitive for the paging problem for k=2.

2. Prove that MRU is not competitive for the paging problem for k=2.

(More problems will be added.)
