What is the MINIMUM combination of paths required to provide full statement coverage?

The correct answer is A. A. Option A (the single path "A") is correct because statement coverage only requires that every statement in the program is executed at least once - and path A alone passes through all statements in the flowchart, satisfying that requirement with a single test case. Option ABD is…

Test Techniques

Question

What is the MINIMUM combination of paths required to provide full statement coverage?

Options

AA
BABD
CABCD
DACD

How the community answered

(45 responses)

A
73% (33)
B
4% (2)
C
16% (7)
D
7% (3)

Explanation

Option A (the single path "A") is correct because statement coverage only requires that every statement in the program is executed at least once - and path A alone passes through all statements in the flowchart, satisfying that requirement with a single test case.

Option ABD is wrong because, while it does achieve full statement coverage, it uses three paths when one is sufficient - the question asks for the minimum combination, not just any valid combination. Options ABCD and ACD fail for the same reason: they all achieve coverage but include unnecessary extra paths beyond what path A already covers.

Memory tip: Statement coverage is the weakest coverage criterion - think "did every line run at least once?" not "did every branch get tested?" Always look for the shortest single path that touches every node/statement before reaching for multi-path combinations; if one path does the job, it is always the minimum.

Topics

#statement coverage#path coverage#white-box testing#control flow

Community Discussion

No community discussion yet for this question.

Full ISEB-SWTINT1 Practice