A strong answer
A strong candidate frames malloc versus calloc: what is the difference? around the exact memory layout, compiler semantics, and hardware execution model covered in Heap Allocation with malloc, calloc, and realloc. Explain how calloc zero-initializes memory while malloc does not, and when to use each.
Stack allocation is fast, but it is constrained by two major limitations:
- Fixed Lifetime: Stack variables are destroyed the instant their enclosing function frame pops. You cannot return a stack buffer to a caller.
- Bounded Capacity: Thread call stacks are small (typically 1 MB to 8 MB). Allocating a 50 MB image buffer or an unknown number of user records on the stack triggers an immediate stack overflow crash.
If a line exceeds 1,024 bytes, the input is truncated. If the function returns buffer, the caller dereferences dead stack memory.
In a production interview, always connect the specification rule to its concrete runtime consequence: state what lives on the stack versus the heap or static storage segment, how the compiler or operating system validates alignments, lifetimes, and error codes, and what happens under adversarial or boundary inputs (such as zero-length buffers, integer overflow, concurrent mutation, or partial I/O). Backing your explanation with a small trace of register/memory state transitions immediately separates senior systems engineers from candidates who only memorized syntax.
What the interviewer is listening for
- Mastery of core invariant: Allocate uninitialized and zeroed heap buffers using malloc and calloc.
- Mastery of core invariant: Inspect how heap allocators store block metadata headers preceding returned pointers.
- Mastery of core invariant: Grow and shrink memory buffers safely without memory leaks using realloc.
- Hardware and ABI awareness: Explaining how sizes, alignments, calling conventions, or kernel boundaries behave on real 64-bit targets rather than relying on implementation-defined assumptions.
- Defensive engineering: Naming the exact compiler flags (
-Wall -Wextra -Werror), static analyzers, or runtime sanitizers (-fsanitize=address,undefined,thread) that verify correctness in CI.
Common mistakes
- Explaining only surface syntax without tracing the underlying memory addresses, ownership lifetime, or kernel/user-space state transitions.
- Assuming undefined behavior (such as signed overflow, uninitialized reads, strict-aliasing violations, or dangling pointers) will "just work" because it passed an unoptimized
-O0debug build. - Ignoring return codes, partial reads/writes, alignment padding, or cleanup paths when an allocation or syscall fails midway through a function.