Explain how V8's Orinoco Garbage Collector (NewSpace Semi-Space Scavenger vs OldSpace Mark-Sweep-Compact, Write Barriers, and Remembered Sets) and Array.

A strong answer

A strong candidate frames Explain how V8's Orinoco Garbage Collector (NewSpace Semi-Space Scavenger vs OldSpace Mark-Sweep-Compact, Write Barriers, and Remembered Sets) and Array. around the exact memory layout, compiler semantics, and hardware execution model covered in [V8 Orinoco Garbage Collector, Old-to-New Write Barriers, Elements Kinds, and TurboFan Deopts]. Contrast $O(\text(live))$ NewSpace copying with OldSpace concurrent marking, explain Old-to-New Write Barriers, trace premature promotion when request latency exceeds 2 scavenge intervals, and explain why TypedArray Structure-of-Arrays bypasses GC scanning.

To 'optimize' garbage collection, an engineer creates a global const pool: RequestContext[] = new Array(50000) at startup and mutates pool[idx] = { user: new Object(), items: [1, 2, 3] } on every incoming request. Instead of getting faster, --trace-gc shows Minor Scavenge pauses jumping from 0.8 ms to 24 ms, and numeric loops over sparse arrays (const arr = new Array(1000); arr[0] = 1.5;) run 12x slower after a single undefined hole is read!

When engineers encounter this bottleneck in production, a surface-level API description rarely explains what went wrong. In real workloads, every line of code executes against concrete hardware constraints: fixed-width memory cells, CPU cache lines, kernel descriptor tables, network socket buffers, or accelerator memory buses. Without a clear mental model of V8 Generational GC (NewSpace Scavenger vs OldSpace), Write Barriers, Elements Kinds, and TurboFan JIT Deoptimization, debugging degrades into guesswork—tuning timeouts, adding retries, or scaling instances blindly while the underlying architectural flaw remains untouched.

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 V8's Generational GC (NewSpace Cheney Semi-Space Scavenger vs OldSpace Mark-Sweep-Compact) and Old-to-New Write Barriers.
• Mastery of core invariant: Prevent Premature Promotion into OldSpace by sizing --max-semi-space-size and avoiding Old-to-New Remembered Set bloat.
• Mastery of core invariant: Preserve PACKED_SMI_ELEMENTS and PACKED_DOUBLE_ELEMENTS array representations and use TypedArray Structure-of-Arrays arenas.
• 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 -O0 debug build.
• Ignoring return codes, partial reads/writes, alignment padding, or cleanup paths when an allocation or syscall fails midway through a function.