best fit
GATE CSE & IT · Memory Management · 1991-2026
Study anchor
Galvin — Operating System Concepts
Processes, scheduling, memory, files, deadlocks
Practice action
Start latest PYQPYQs in this concept
All concepts →Consider contiguous allocation of physical memory to processes using variable partitioning scheme. Suppose there are 8 holes in the memory of sizes $20 \mathrm{~KB}, 4 \mathrm{~KB}...
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...
Consider six memory partitions of sizes $$200$$ $$KB,$$ $$400$$ $$KB,$$ $$600$$ $$KB,$$ $$500$$ $$KB,$$ $$300$$ $$KB$$ and $$250$$ $$KB,$$ where $$KB$$ refers to kilobyte. These pa...
A computer installation has 1000K of main memory. The jobs arrive and finish in the following sequence. Job 1 requiring 200k arrives Job 2 requiring 350k arrives Job 3 requiring 30...
State whether the following statement TRUE or FALSE. The best-fit techniques for memory allocation ensures the memory will never be fragmented.