what is cyclomatic complexity? plz explain with example
Answer Posted / nitin verma
In the Cyclometris Complexity we find the shortest path
between the nodes.The formula is
V(G)=e-n+2p where,
G= Graph
e= no. of edges
n= nodes
p= no. of paths
plz Correct me if i m wrong....
nitin9360@yahoo.com
Is This Answer Correct ? | 27 Yes | 36 No |
Post New Answer View All Answers
Are there more defects in the design phase or in the coding phase?
WHAT IS PROTOCAL TESTING..EXPLAIN? L2, L3 PROTOCALS TESTING MEANS WHAT?EXPLAIN BRIEFLY
What ishigh severity, low priority bug?
ANY ONE HAS ATTENDED THE INTERVIEW FOR WIT INNOVATION P LTD? THEN KINDLY LET ME KNOW ABOUT THE INTERVIEW PROCESS AND QUESTIONS ASKED.
I have 6 months experience as project tarine and one and a half year experience as software engineer.Should i write taht my total experience id 2 years.
Why Equivalence Partitioning is called equivalence or what is the significance of equivalence term in ECP?
what is acid testing?
What are the possible test scenarios around AVS check of any credit card? (Testing through payment gateway online) (What are the fields we should check while checking AVS and CVV)
What are the factors affecting a manual testing project and what are the ways to overcome it?
What is common interface?
what is the function generator?
What are the main key components in Web applications and Client Server applications? and their differences?
Can some one help me writing a manual test case for email applications like yahoo i need for www.everonn.com
what types of bugs will we find out in banking projects
can anybody tell me what is release process of company? release note?