Multiple choice technology testing

Choose the best match for cyclomatic complexity

  1. The number of decision statements plus one

  2. A set of Boolean conditions such that complete test sets for the conditions uncover the same errors

  3. The process of analyzing and correcting syntactic logic and other errors identified during testing

  4. None of the above
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

Cyclomatic complexity V(G) is calculated as the number of decision statements (predicate nodes) plus one, or more formally E - N + 2P for a connected graph. It measures program control flow complexity and the minimum number of test paths needed.

Keep practicing — related questions