How the value of P in cyclomatic complexity is calculated?
P:The number of connected path.
- 1 Answers
- 5394 Views
- I also Faced
- E-Mail Answers
Answer / dheeraj shandilya
McCabe's cyclomatic complexity(M) is given by:
M=L-N+2P
where L= no. of links in flowgraph
N= no. of nodes in flowgraph and
P= no. of connected component
(or no. of disconnected parts of flowgraph)
In graph theory, a connected component of an undirected
graph is a subgraph in which any two vertices are connected
to each other by paths, and which is connected to no
additional vertices. For example, see slide no 21(40) of
www.cs.drexel.edu/~spiros/teaching/SE320/slides/metrics.ppt
| Is This Answer Correct ? | 6 Yes | 0 No |
what is difference between bug and defect who will find bug and who will find out defect ..(Like developer or tester)?
What are testing techniques? What is difference between general and specific?
what do you mean by Develop test data through sourcing (or) handcrafting techniques
What is Automation Test frame work ?
What should be tested when Unit Testing is conducted?
Training for Manual/QTP Testing from 6 years MNC experience engineer, working in Patni with Project .Guranteed Job training else fee back in Mumbai-mail-- >amol.dhumalatrediffmail dot com
Explain Bug Tracker
What is Test Procedure? What are Test matrices? What is Tracibility matrix?
WHAT IS THE DIFFERENCE BETWEEN PRIORITY AND SEVEARITY ?
How to test the search functionality.For example in naukri advance search is there.how ca i test that page.
Did you have access to all the modules(Requirements, Test plan,Test Lab, Defects, & Dashboard) in Quality Center(QC) or only to some particular ones?
write five negative testcase for web application?
Automation Testing 
