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.

Correct : c

Similar Questions

The size of the physical address space of a processor is 2P bytes. The word length is 2W bytes. The capacity of cache memory is 2N bytes. The size of each cache...
#225 MCQ
Assume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long. The memory is word addressable. The page...
#235 MCQ
A computer system with a word length of 32 bits has a 16 MB byte- addressable main memory and a 64 KB, 4-way set associative cache memory with a block size of 2...
#281 MCQ

Related Topics

memory allocation computer science GATE CS 2020 first fit vs next fit worst fit algorithm best fit algorithm memory hole creation GATE computer science questions comparison algorithms memory allocation theory

Unique Visitor Count

Total Unique Visitors

Loading......