A strong answer
A strong candidate frames How does an if statement execute on real hardware? around the exact memory layout, compiler semantics, and hardware execution model covered in Conditions and Branches: if, else and switch. Translate conditions into comparisons and jumps, trace taken paths, and name classic branch defects.
Until now every program ran its statements in order, once. Real programs have to choose: show an error or a result, assign a grade, take one of several actions depending on a command. The language needs a way to run some code only when a condition holds.
Here grade ends up as 'B'. Reading that is easy for a person. The interesting question is what the machine does, because the CPU has no idea what an if is. It can only execute one instruction after another, and occasionally jump to a different place.
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: Trace which block of an if-else chain runs for a given value, and which blocks are skipped.
- Mastery of core invariant: Explain how a condition becomes a comparison followed by a conditional jump.
- Mastery of core invariant: Predict the output of a switch statement with and without break.
- 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.