A control-flow graph has 9 edges and 7 nodes. Its cyclomatic complexity is:
Show answerHide answer
Correct answer: (A) 4
Explanation
V(G) = E − N + 2 = 9 − 7 + 2 = 4.
From DSSSB TGT Computer Science Full Mock Test 2
This is question 183 of DSSSB TGT Computer Science Full Mock Test 2. See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.