GATE 2009 CS – Question 50
Which statements about a module control-flow graph’s cyclomatic complexity are TRUE?
I. It equals the maximum number of linearly independent circuits in the graph.
II. It is the number of decisions plus one, where any conditional statement is a decision.
III. It gives the number of linearly independent paths to test in path-coverage testing.
Practise this question in The GATE Grind →
Show answer and explanation
Correct answer: (B) II and III
Explanation
We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort