GATE | Gate IT 2007 | Question 53
Consider the following pseudo-code:
The cyclomatic complexity of the pseudo-code is
Explanation: Cyclomatic complexity = (π − s + 2)
where π is the number of decision points in the program, and s is the number of exit points.
Quiz of this Question
Please comment below if you find anything wrong in the above post
My Personal Notes arrow_drop_up
Please Login to comment...