Multiple choice technology testing

Cyclomatic complexity is used to calculate

  1. number of independent paths in the basis set of a program

  2. number of binary decisions + 1

  3. upper bound for the number of tests that must be conducted to ensure that all statements have been executed at least once

  4. number of branches and decisions
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Cyclomatic complexity V(G) = number of binary decisions + 1 (or more formally, predicate nodes + 1). This is the standard ISTQB definition. Option A describes what V(G) represents, not how to calculate it. Option C describes statement coverage upper bound, not the calculation itself. Option D is vague. Option B gives the correct calculation formula.

Keep practicing — related questions