How the value of P in cyclomatic complexity is calculated?
P:The number of connected path.
- 1 Answers
- 5719 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 |
In your company,does a different tester writes test cases & a different one executes them or a particular tester writes a set of test cases & executes them too?
whta is compile module?
As a Test Analyst, what is the first thing you do when you receive the Functional Spec for a project?
after inserting the record in front-end,how will u check the backend manually?
What should be the knowledge of white-box tester differs than the back-box tester.?
what are risks and contigencies(solutions) of an ecommerce (online shopping and bidding project)application?we describe this in Test plan can anyone tell me abt this?
what is test strategy and methodology ?what is the different between them?
Any body can write the test cases for Address field, Mobile Number field & Landline Number field ?
3 Answers Maslin Technologies,
What is bug life cycle?
i got my Quality center cd from Nageswararao institute?can any body help me how to install it?
Could anyone let me know five positive and negative testcases for ATM machine..?
What are all the usability guidelines to consider for testing WWW?
Automation Testing 
