adplus-dvertising
frame-decoration

Question

What is the formula for McCabe's cyclomatic complexity?

a.

CV=e-n+p+1

b.

CV=n-e+p+1

c.

CV=e+n-p+1

d.

CV=n+e-p-1

Posted under Software Engineering

Answer: (a).CV=e-n+p+1 Explanation:The formula for McCabe's cyclomatic complexity is CV=e-n+p+1, where e, n and p denote the number of edges, nodes, and connected components in the control graph, respectively.

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. What is the formula for McCabe's cyclomatic complexity?

Similar Questions

Discover Related MCQs

Q. What does the cyclomatic complexity of a program depict?

Q. What is the suggested limit of cyclomatic complexity by McCabe?

Q. What is the purpose of McCabe's cyclomatic complexity metric during testing?

Q. What do complexity metrics like those of Halstead and McCabe measure?

Q. What is the purpose of complexity metrics like McCabe's, Halstead's and others?

Q. What is the problem with the known complexity metrics?

Q. What is the 'representation condition' In terms of measurement theory?

Q. Can a higher value of complexity metric necessarily mean that a program is more complex?

Q. What is the recommendation for the use of complexity metrics?

Q. What do validations of software science and cyclomatic complexity indicate?

Q. Why is the length of a program (number of lines of code) often used as an indicator of complexity?

Q. What does the graph depict in the design process of a set of modules and their mutual dependencies?

Q. What is the purpose of knowing the intermodule relations in a design process?

Q. What is the information flow between modules restricted to in a proper design?

Q. What is the purpose of the graph in the design process of a system?

Q. What is the amount of knowledge between modules supposed to be kept to a minimum?

Q. What is the graph depicting the uses-relation often referred to as?

Q. What is the most general form of the call graph?

Q. What is the uses-relation called if the graph is acyclic?

Q. What is the size of the call graph measured in terms of?