EMERGING TRENDS IN SOFTWARE ENGINEERING
MISCELLANEOUS
|
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: -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-2: -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-3: -What is Cyclomatic Complexity? Cyclomatic complexity is a source code complexity measurement that is being correlated to a number of coding errors. It is calculated by developing a Control Flow Graph of the code that measures the number of linearly-independent paths through a program module.
Detailed explanation-4: -Cyclomatic complexity is defined for each module to be e-n + 2, where e and n are the number of edges and nodes in the control flow graph, respectively.