Interested to Buy Any Domain ? << Click Here >> for more details...
what is cyclomatic complexity ?
- 2 Answers
- 10064 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / nitin verma
Hi,
In the cyclometric complexity we find the best shortest
path to reach to the destination node.the formula for this
is
V(g)=e-n+2p
g= graph
e= edges
n= nodes
plz correct me if i m wrong...
nitin9360@gmail
| Is This Answer Correct ? | 2 Yes | 0 No |
Answer / 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 |
What is a Test Bed?
plz explain about tracebility matrix with example? thanks in advance
What is Interoperability Testing? What is Risk Based Testing?
What is Cursor Testing? Is it come under Manual or Automation testing .Explain?
what is traceability matrix ?what is use of that matix ?
What is Sanity Testing?
MS Paint
how to connect your project in database?
Do you face any showstoppers issue in your current project? Explain
What are the properties of a good requirement?
how many testers r there in ur project?and hw did u divide ur work? plzzzzzzz answer
What r the sequences that leads to automation?
Automation Testing 
