Question $12$

Regarding memory management partitioning algorithms, which of the following best describes worst fit?

scans the linked list, when it finds the first big enough hole, loads the process

scans the linked list starting from the node where it previously allocated a hole, finds a big enough hole, loads the process

scans the entire linked list every time, finds the biggest hole for the process size, loads the process

scans the linked list, finds the smallest hole for the process size, loads the process