You can design a very primitive algorithm. For memory allocation: Have a circular linked list, and can implement couple of algorithms such as first bit, best fit and next fit. For memory deallocation (automatic): Mark and sweep or reference couting.