Answer Posted / kamal prakash
The number of independent paths through a program.
Cyclomatic
complexity is defined as: L ? N + 2P, where
-L = the number of edges/links in a graph
-N = the number of nodes in a graph
- P = the number of disconnected parts of the graph (e.g. a
called graph and a subroutine)
kamalzoom@gmail.com
| Is This Answer Correct ? | 2 Yes | 1 No |
Post New Answer View All Answers
functional testing and usability testing test cases for transfer funds...
What are the main key components in web applications and client and server applications?
plz send the test scenarios and test cases for "user name should contain 4 to 8 chars and they should have only vowels"
what is the technical challange you faced in your module.please ans me the question i just want example can me any example please very important
Can you explain boundary value analysis?
What are the interview question on insurance domain in manual testing
What's the relationship between environment reality and test phases?
What is Independant Testing? When and where this type of testing will be performed?
What is Snapshot Testing? When we need to do and who will involve in this process and also what is the output document of this testing
Have you prepared traceability matrix and how to prepare it?
What is XML Testing? Do we have any tools to test the XML? Please let me know.
Need to know about Quality Center in brief
I have 2 years of exp. in testing and looking for a change if any body knows, about any vacancy in testing then plz contact me on deepti_ac@yahoo.co.in
About Hierarchy level in your company.
Explain severity with example and expalin each example?
