Manage free memor Linked list a Double linked list o How to allocate free memory to programs? First fit a quick; beginning used more often; break a large free space Next fit o every time from where last time used Best fit a Search entire list finds the hole close to the actual size Worst fit a Finds the largest hole Quick fit a Keeps separate queues of processes and holesManage free memory ◼ Linked list ❑ Double linked list ❑ How to allocate free memory to programs? ◼ First fit ❑ quick; beginning used more often; break a large free space ◼ Next fit ❑ Every time from where last time used ◼ Best fit ❑ Search entire list, finds the hole close to the actual size ◼ Worst fit ❑ Finds the largest hole ◼ Quick fit ❑ Keeps separate queues of processes and holes