What is cyclomatic complexity and why is it important?
- 1 Answers
- 4286 Views
- I also Faced
- E-Mail Answers
Answer Posted / sheetal
What is cyclomatic complexity
Cyclomatic complexity is a computer science metric
(measurement) developed by Thomas McCabe used to generally
measure the complexity of a program. It directly measures
the number of linearly independent paths through a programs
source code.
The concept, although not the method, is somewhat similar to
that of general text complexity measured by the
Flesch-Kincaid Readability Test.
Cyclomatic complexity is computed using a graph that
describes the control flow of the program. The nodes of the
graph correspond to the commands of a program. A directed
edge connects two nodes, if the second command might be
executed immediately after the first
command. By definition,
CC = E - N + P
where
CC = cyclomatic complexity
E = the number of edges of the graph
N = the number of nodes of the graph
P = the number of connected components
| Is This Answer Correct ? | 2 Yes | 1 No |
Post New Answer View All Answers
What is the difference between user control an custom control?
Explain transparent caching with aop?
Which tool you have done?
What is viewstategenerator?
What is the difference between exe and dll?
Explain what benefit does your code receive if you decorate it with attributes demanding specific security permissions?
What is web api vs wcf?
Suppose You Want A Certain Asp.net Function Executed On Mouseover For A Certain Button. Where Do You Add An Event Handler?
How long does an http session last?
How does windows service lifecycle differ from a .standard. Exe?
What are the new features implemented in ASP.NET?
What does it mean your session has timed out?
What are session state modes in asp.net?
What are the main differences between asp and asp.net?
What is the usie of activex control in .net?
