White-Box Test Design Flashcards
7 cards from real ISTQB practice questions. Tap to flip, then mark Knew It or Still Learning — missed cards come back until you master them.
Read the first 7 White-Box Test Design flashcards as text
Which coverage criterion requires that every loop in the code is executed at least once with zero iterations, one iteration, and multiple iterations?
Answer: Loop coverage
Loop coverage specifically targets loop constructs by requiring execution with zero, one, and multiple iterations to reveal off-by-one and boundary errors.
A developer has written a function with 5 independent conditions in a single compound predicate. How many test cases are needed for Modified Condition/Decision Coverage (MC/DC)?
Answer: 6
MC/DC requires N+1 test cases for N independent conditions, so 5 conditions require 6 test cases.
In control flow testing, what is a 'predicate' node?
Answer: A node where the flow splits based on a condition
A predicate node is a decision point in the control flow graph where execution can follow different paths based on a Boolean condition.
Which white-box technique is MOST suitable for testing code that contains nested if-else structures with complex boolean expressions?
Answer: MC/DC coverage
MC/DC is specifically designed to independently test each condition within complex Boolean expressions, making it ideal for nested conditionals.
A tester achieves 100% statement coverage on a module. What can they conclude?
Answer: Every executable statement was executed at least once
100% statement coverage only guarantees every executable statement was executed at least once; branches and paths may remain untested.
In data flow testing, a 'kill' (k-use) of a variable occurs when:
Answer: The variable is assigned a new value, overwriting the previous one
A kill or definition-kill occurs when a variable is re-defined or assigned a new value, terminating the previous definition's reach.
Which metric is used to estimate the minimum number of independent paths in a program and thus the minimum test cases for path coverage?
Answer: Cyclomatic complexity
Cyclomatic complexity (V(G) = E - N + 2P) gives the number of linearly independent paths through the code.