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 tests activities that you want to automate in a project?
What is a weighted Defect What is Defect Density
hi guys ! tel me the adress of the ordian solutions..?whr it is ..?
What is basic block?
Could anyone share FAQs for QA/QC position.
What kind of things that forbidden to do by a SQA Tester if He/ She don’t want to get fired?
What are the five common solutions for software developments problems?
What are the solutions for the software development problem?
What is conformance testing?
What is binary portability testing?
What is test metric is software testing and what information does it contains?
What are the benefits of automated testing?
is the transmission line voltage delta confoguration?
What is the role of qa in a project development?
What is a bug life cycle?