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
Testcases for msword( microsoct office word??
What is an audit report? Whom is it done by?
What is the big deal about ‘requirements’?
Have you ever completely tested any part of a product? How?
what we have to read to gain knowledge in banking and financial domain(software testing) for 4+ experience
What is pesticide paradox?
what could be the (realtime)bugs you come across in job portal and health care projects in terms of 1. high severity n low priority 2. high severity n high priority 3. low severity n low priority 4. low severity n low priority? pls its very urgent thanks n in advance n lukin forward for reply
Plz give me manual testing real test case ?
tell wat u did in ur banking project?
What are the typical risks that you identify during test planning and their mitigation plan and Contengency plan.
what are the status have in QC(Test Management Tool). and how you report?
What if the project isn’t big enough to justify extensive testing?
Which test cases are written first: white boxes or black boxes?
Can u give me explanation about section 508 testcase and Testcase for this section. It need a details checklist for the same Manimozhi
HI. ANYONE HAS ATTENDED INTERVIEW FOR TESTING IN MINDKRAFT GLOBAL. I HAVE WRITTEN TEST FOR SOFTWARE TESTING. CAN ANYONE TELL ME WHAT ALL QUESTIONS CANBE ASKED. PLS REPLY. THANK YOU