Question

In dynamic memory partitioning, the 'Best-Fit' allocation algorithm satisfies a memory request by selecting:

A A randomly chosen free block from the free list
B The smallest free block that is still large enough to satisfy the request
C The largest available free block in the entire memory
D The free block located physically closest to the start of memory
E The first free block found that is large enough to satisfy the request
Practice Next

Hey! Ask a query

🎓
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
  • 200 Questions with Detailed Solutions
  • Section-wise Coverage (GA, English, Quant & Reasoning)