[amp_mcq option1=”best fit” option2=”first fit” option3=”worst fit” option4=”buddy E. None of the above” correct=”option3″]
The correct answer is C. worst fit.
In worst fit, the program is placed in the largest available hole in the main memory. This strategy is not very efficient, as it wastes a lot of space. However, it is simple to implement and can be used in real-time systems where speed is more important than efficiency.
Best fit is a storage placement strategy in which a program is placed in the smallest available hole in the main memory that is large enough to hold the program. This strategy is more efficient than worst fit, as it wastes less space. However, it is more complex to implement and can be slower than worst fit.
First fit is a storage placement strategy in which a program is placed in the first available hole in the main memory that is large enough to hold the program. This strategy is simpler to implement than best fit, but it is not as efficient.
Buddy system is a storage management technique for dynamic allocation of memory. It is based on the idea of dividing the available memory into a number of equal-sized blocks, called buddies. When a program needs to be allocated memory, it is assigned the smallest buddy that is large enough to hold the program. If there are no buddies that are large enough, then the buddy system will split one of the larger buddies into two smaller buddies.
None of the above is not a valid storage placement strategy.