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 |
How many testcases have you written till, now as an average per project?
What is Analyzing the test results / Reports mean ? plz its urgent
what is a functionality
About Testing
what is application server, Database server and test server
To become a Software Tester, which courses are more important to learn? I Feel complete software testing course like manual, automation, Oracle, VB Scripting and SQL, please suggest me what are all the courses important for a software tester?
i finished writing test caes, logged bugs and also regression testing i finished.when we do user acceptance testing?
Hi Friends, Can anybody email me Contents of Manual Testing on my email ie mca.rachna21@gmail.com.
What is the difference bet white box testing and black box testing.pls give me an example
1) What is the differrence in Test Strategy and Test Approach 2)What is System Integrartion Testing
what is test case review?
Where we save the bugs?