Question 6
If a single-procedure control flow graph contains P predicate nodes (decision points like if/while), what is its Cyclomatic Complexity V(G)?
Detailed Solution
Option C is correct. For a control flow graph of a single procedure with P predicate nodes (binary decision conditions), Cyclomatic Complexity is V(G) = P + 1.