Monday, 16 October 2017

Net 18

CBSE NET JUNE 2012 PAPER III

Which one of the following statements is incorrect ?

(A) The number of regions corresponds to the cyclomatic complexity.
(B) Cyclometric 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 the flow graph.
(C) Cyclometric complexity for a flow graph G is V(G) = E – N + 2, where E is the number of edges & N is the number of nodes in the flow graph.
(D) Cyclometric 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.

Ans: (B)

Explanation:
To solve above problem, first remember these 3 rules to compute the cyclomatic complexity.
1. The number of regions correspond to the cyclomatic complexity.
2. Cyclomatic complexity V(G) for a flow graph G, is defined as, 
V(G)=E-N+2
where E=Number of flow graph edges 
N=Number of flow graph nodes
3.Cyclomatic complexity,V(G) for a flow graph G, is defined as,
V(G)=P+1
where P=Number of predicate nodes contained in flow graph G.

Now come to the solution for above problem,
According to the rules given in (1),(2) and (3), option B is incorrect.

Related topics

Professor Jayesh video tutorial

Please use contact page in this website if you find anything incorrect or you want to share more information about the topic discussed above.