1.

Consider the following pseudo-codewhile (m < n)if (x > y) and (a < b) thena = a + 1y = y - 1end ifm = m + 1end whileWhat is the cyclomatic complexity of the above pseudo-code?

A. 2
B. 3
C. 4
D. 5
Answer» D. 5


Discussion

No Comment Found