Memory Allocation
Everything on SkillVeris tagged Memory Allocation — collected across the glossary, study notes, blog, and cheat sheets.
7 resources across 1 library
Interview Questions(7)
Static Arrays vs Dynamic Arrays: What is the Difference?
A static array has a fixed size decided at creation time and cannot grow or shrink, giving O(1) indexed access with minimal overhead, while a dynamic array (li…
What is the Buddy System for Memory Allocation?
The buddy system is a kernel memory allocator that manages physical memory in power-of-two-sized blocks, splitting a large free block into two equal buddies to…
What is the Slab Allocator?
The slab allocator is a kernel memory allocator that caches pre-initialized, fixed-size objects (like task structs or inodes) in contiguous slabs carved from b…
Internal vs External Fragmentation
Internal fragmentation is wasted space inside an allocated block because it is larger than what was requested, while external fragmentation is wasted space bet…
Memory Allocation Strategies: First Fit, Best Fit, Worst Fit
Memory allocation strategies are the algorithms an OS uses to pick which free block of memory to give a new process from a list of available holes, the three c…
First Fit vs Best Fit vs Worst Fit Memory Allocation
First fit, best fit, and worst fit are contiguous-memory allocation strategies that scan a free-block list differently: first fit picks the first hole large en…
What Causes External Fragmentation and How Is It Solved?
External fragmentation happens when free memory becomes scattered into many small, non-contiguous holes so that even though total free space is sufficient, no…