Question

An expression for the calculation of cyclomatic complexity.

(a) V(G) = E – N + 2

(b) V(G) = E + N + 2

(c) V(G) = E – N – 2

(d) V(G) = E + N –  2

I got this question by my college professor while I was bunking the class.

Question is taken from System Evaluation & Maintenance topic in division System Implementation and Operation of Computer Fundamentals

Answer 1

The correct answer is (a) V(G) = E – N + 2

The explanation: The option V(G) = E – N + 2 denotes the correct expression. Here, E is the number of flow graph edges.  N is the number of flow graph nodes.