Question 3678 – Data-Structures
November 28, 2023Question 10356 – Computer-Networks
November 28, 2023Question 3697 – Data-Structures
The cyclomatic complexity of a flow graph V(G), in terms of predicate nodes is: [Where P is number of predicate nodes in flow graph V(G).]
Correct Answer: A
Question 408 Explanation:
There are 3 formulas to find cyclomatic complexity.
1. The number of regions corresponds to the cyclomatic complexity
2. V(G),Flow graph is defined as V(G)=E-N+2 where E is the number of flow graph edges, and N is the number of flow graph nodes.
3. V(G),Flow graph is defined as V(G)=P+1 where p is the number of predicate nodes contained in the flow graph G.
1. The number of regions corresponds to the cyclomatic complexity
2. V(G),Flow graph is defined as V(G)=E-N+2 where E is the number of flow graph edges, and N is the number of flow graph nodes.
3. V(G),Flow graph is defined as V(G)=P+1 where p is the number of predicate nodes contained in the flow graph G.
P + 1
P – 1
P – 2
P + 2
Subscribe
Login
0 Comments