Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / vidya
Cyclomatic complexity is a software metric (measurement).
It was developed by Thomas McCabe and is used to measure
the complexity of a program. It directly measures the
number of linearly independent paths through a program's
source code. It 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.
Definition
M = E − N + 2P
where
M = cyclomatic complexity
E = the number of edges of the graph
N = the number of nodes of the graph
P = the number of connected components.
"M" is alternatively defined to be one larger than the
number of decision points (if/case-statements, while-
statements, etc) in a module (function, procedure, chart
node, etc.), or more generally a system.
Separate subroutines are treated as being independent,
disconnected components of the program's control flow graph.
| Is This Answer Correct ? | 1 Yes | 1 No |
Post New Answer View All Answers
What are the key challenges of software testing?
What is the difference between the test plan and test strategy
What are the table contents in testplans and test cases?
What test strategy followed in your project?
What Contains in Business Design Document?
Why are you in qa?
What is a cookie testing?
iq test
What is the difference between compatibility testing and cross browser testing?
How do you decide you have tested enough?
I want to know about the open source licenses and its features
How to create requirements test matrix template?
What is the difference between quality assurance, quality control and testing?
can you explain the software testing life cycle?
What is the difference in responsibilities of programmers and qa analyst?
