Computer-Networks
August 2, 2024Computer-Networks
August 2, 2024Software-Engineering
| Question 229 |
McCabe’s cyclomatic metric V(G) of a graph G with n vertices, e edges and p connected component ise
| e | |
| n | |
| e – n + p | |
| e – n + 2p |
Question 229 Explanation:
Cyclomatic complexity uses 3 formulas
1. Number of regions + 1
2. Predicate + 1
3.Edges-Vertices+2(Connected components)
As per the above question, c=cyclomatic complexity
e=number of edges
n=number of vertices
p=predicates
1. Number of regions + 1
2. Predicate + 1
3.Edges-Vertices+2(Connected components)
As per the above question, c=cyclomatic complexity
e=number of edges
n=number of vertices
p=predicates
Correct Answer: C
Question 229 Explanation:
Cyclomatic complexity uses 3 formulas
1. Number of regions + 1
2. Predicate + 1
3.Edges-Vertices+2(Connected components)
As per the above question, c=cyclomatic complexity
e=number of edges
n=number of vertices
p=predicates
1. Number of regions + 1
2. Predicate + 1
3.Edges-Vertices+2(Connected components)
As per the above question, c=cyclomatic complexity
e=number of edges
n=number of vertices
p=predicates