UGC NET CSE | June 2012 | Part 3 | Question: 33

Question

Which one of the following statements is incorrect?

• A. The number of regions corresponds to the cyclomatic complexity
• B. Cyclomatic complexity for a flow graph $G$ is $V(G)=N-E+2$, where E is the number of edges and N is the number of nodes in flow graph.
• C. Cyclomatic complexity for a flow graph $G$ is $V(G)=E-N+2$, where E is the number of edges and N is the number of nodes in flow graph.
• D. Cyclomatic complexity for a flow graph $G$ is $V(G)=P+1$, where P is the number of predicate nodes contained in the flow graph G.

Comments

The incorrect statement is B, and A, C, D are correct statements. It seems the chosen best answer is wrong according to the question.

Answer 1

Answer : Cyclomatic complexity for a flow graph G is V(G)=E-N+2, where E is the number of edges and N is the number of nodes in flow graph.

Cyclomatic complexity is a software metric (measurement), used to indicate the complexity of a program

Cyclomatic complexity = E - N + P 
where,
  E = number of edges in the flow graph.
  N = number of nodes in the flow graph.
  P = number of nodes that have exit points

Reference : Cyclomatic Complexity

Answer 2

A. IS CORRECT COZ CP=# OF REGIONS OR # OF CLOSED REGIONS + 1

B IS INCORRECT....

C. IS CORRECT AS IT IS THE EASY WAY TO CALCULATE IF EDGE, NODES ARE GIVEN

D. IS CORRECT COZ CP =# OF DECISION STATEMENTS + 1 OR # OF PREDICATE NODES + 1

Answer 3

Ans: B

ref: http://www.ferdocs.com/g/presentation/339/cyclomatic-complexity