This java applet demonstrates the three main page placement strategies in Operating systems: First fit, best fit, and worst fit.
 The data for creation and destruction of processes is described in the 'Process Listing' Text Area. If there is not enough room to allocate memory to a process, it will be indicated in the 'Notices' Text Area, and the algorithm implied in the text area will cease.  The square buttons are used to show pages in memory (256 pages for test). The 'Random' button will randomly generate (and show) the next page allocation or deallocation. 
The Free List for First-fit is ordered by Ascending Address,
The Free List for Best-fit is ordered by Ascending Size,
The Free List for Worst-fit is ordered by Descending Size.