what is cyclomatic complexity ?
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 |
Hi, this is sekhar yadav plz answer my questions with(examples) highest seviarity &lowest priarity and lowest seviarity & highest priarity ???? i want proper answer .. thankq
What is the usability test case for yahoo login page
How to do Data base testing manually?
Difference between Re-testing and Regression testing?
what is the template u used for informing clients regarding known issues when u near to release
What is OSS and BSS?
What are the cases why parameterization is necessary when load testing the Web server and the database server?
i live in australia and i have come to india for holiday and i want to give my ISTQB exam so which is preferrable?giving exam in INDIA /AUSTRALIA?Does it really matters?
What is your approach when requirements change continuously?
Hi all, Currently i have completed 2 years in Accenture@manual testing. i have ISTQB CTFl certification too. I have fair idea on J2EE programming too. I have basic knowledge on mainfreame testing and QTP also. So with these skills how much package will be offered if we opt to switch the company...Please suggest me folks
How many bugs occured will be considerd appropriate over 1000 steps when inspecting software? Describle an approriate Bug value.
Explain the test plan, how to prepare the test plan