How the value of P in cyclomatic complexity is calculated?
P:The number of connected path.
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 testing life cycle please any one explain briefly
My name is Akpos from Nigeria. I have finished manual testing course. Please, can someone advise me where to go on from here?
what we have to do if the application has some additional functionality which is not specified as part of functional spec.(but is useful.. may b futher) Do we consider it as a defect?
Hi friends I am kranti completed my IT diploma in 2005 & after that complete my software testing course. Now I am working in small software form as software tester. I have 2 + year experience in manual testing. Now I wan to change company. Plz told me is there any effect that I can not have any degree although I have 2 + experience ?
what is v model need clear explanation with advantages and disadvantages?
how many web pages in your application?
what is a broken link in web testing and how test it.
11 Answers Accenture, Thomson,
What is programe specification deleverable documents of SDLC ?
What is the difference between bug and defect?
What is the Difference between 2 tier and 3 tier Applications...Actually what is a tier.. Anybody can body can give accurate answer..Thanks in advance..........
what is the cheklist to check SRS document (after releasing) as a test ingineer and how can we check
How you assign severity for a defect?