Answer to Question 3 -- 9 points

1. Thrashing occurs when the sum of the sizes of the working sets of all resident processes is larger than the size of physical memory; or when the amount of memory allocated to a process is smaller than its working set.
2. Belady's anomaly pertains to page replacement algorithms. A replacement algorithm exhibits Belady's anomaly if there exists a sequence of page accesses that generates more page faults when X pages are allocated for the process than when Y pages are allocated, and X > Y.
3. A safe state is one in which there exists an ordering of processes, p1 through pn such that p1 can allocate all of its resources and complete, then p2 can allocate all of its resources and complete, and so on until all processes are complete. If a system is always in a safe state, then it cannot deadlock.