How do vector and array differ in size knowledge and copying?

A strong answer

A strong candidate frames How do vector and array differ in size knowledge and copying? around the exact memory layout, compiler semantics, and hardware execution model covered in std::array and std::vector. Compare raw arrays with array and vector on size tracking, copy rules, and checked access.

The raw array of lesson 1 has three weaknesses. It forgets its own length as soon as you pass it to a function. It cannot be copied or compared with = and ==. And its size is fixed when the program is compiled. The standard library fixes these with two containers that keep the contiguous layout you already understand: std::array for a fixed size, and std::vector for a size that changes while the program runs.

A word on notation: the type in angle brackets, as in std::vector<int>, is the element type. Read it as "a vector of int". The mechanism behind it, templates, comes in a later module.

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: Compare std::array, std::vector and a C array in size, copying and checking.
• Mastery of core invariant: Describe how a vector is laid out: a small object plus a heap buffer.
• Mastery of core invariant: Choose between operator[] and at() and say what each does on a bad index.
• 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.