Consider the following pseudo code
while (m < n) if (x > y ) and (a < b) then a=a+1 y=y-1 end if m=m+1 end while
What is cyclomatic complexity of the above pseudo code?
(A) 2
(B) 3
(C) 4
(D) 5
All Replies
Viewing 1 replies (of 1 total)
Viewing 1 replies (of 1 total)
- You must be logged in to reply to this topic.