* First fit (In the first fit, the first available free hole fulfills the requirement of the process allocated.)
* Best fit (In the best fit, allocate the smallest hole that is big enough to process requirements. For this, we search the entire list, unless the list is ordered by size.)
* Worst fit (Allocate the largest available hole to process. This method produces the largest
leftover hole.)