COMPUTER SCIENCE AND ENGINEERING
SOFTWARE ENGINEERING
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
V(G)=e-n+2P
|
|
|
V(G)= pi +1
|
|
|
V(G)=Number of regions of the graph
|
|
|
All of the above
|
Detailed explanation-1: -Cyclomatic Complexity, V(G), for a flow graph, G, is defined as V(G) = E-N + 2 where E is the number of flow graph edges, N is the number of flow graph nodes.
Detailed explanation-2: -Given a CFG, the cyclomatic complexity metric is computed as E − N + 2 × P, where E is number of edges of the CFG, N is the number of nodes, and P is the number of modules in the program.
Detailed explanation-3: -Answer: (a) White box testing. Explanation: Cyclomatic complexity is a software metric, which is used to measure the complexity of a program. It gives the minimum number of paths that can generate all possible paths through the module.
Detailed explanation-4: -Cyclomatic complexity is a measurement developed by Thomas McCabe to determine the stability and level of confidence in a program. It measures the number of linearly-independent paths through a program module. Programs with lower Cyclomatic complexity are easier to understand and less risky to modify.
Detailed explanation-5: -According to rule 2, the formula for Cyclomatic Complexity V(G)=e-n+2 where e is no of edges, n is no of vertices.