What hole will allocates in "Worst-Fit" algorithm of memory management?
A. It allocates the smaller hole than required memory hole
B. It allocates the smallest hole from the available memory holes
C. It allocates the largest hole from the available memory holes
D. It allocates the exact same size memory hole
Answer: Option C
Solution (By Examveda Team)
Worst Fit allocates a process to the partition which is largest sufficient among the freely available partitions available in the main memory. If a large process comes at a later stage, then memory will not have space to accommodate it.This Question Belongs to Computer Fundamentals >> Operating System
These partitions may be allocated in 4 ways:
1. First-Fit Memory Allocation
2. Best-Fit Memory Allocation
3. Worst-Fit Memory Allocation
4. Next-Fit Memory Allocation
These are Contiguous memory allocation techniques.
Worst-Fit Memory Allocation :
In this allocation technique, the process traverses the whole memory and always search for the largest hole/partition, and then the process is placed in that hole/partition. It is a slow process because it has to traverse the entire memory to search the largest hole.
Details
https://www.geeksforgeeks.org/worst-fit-allocation-in-operating-systems/