Computer Sciences > Gate 2020 > Memory Management
Consider allocation of memory to a new process. Assume that none of the existing holes in the memory will exactly fit the process’s memory requirement. Hence, a new hole of smaller size will be created if allocation is made in any of the existing holes. Which one of the following statement is TRUE ?
A
The hole created by first fit is always larger than the hole created by next fit.
B
The hole created by worst fit is always larger than the hole created by first fit.
C
The hole created by best fit is never larger than the hole created by first fit.
D
The hole created by next fit is never larger than the hole created by best fit.

Explanation

Correct : c

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science