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

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

Hi friends I am kranti completed my IT diploma in 2005 & after that complete my software testing course. Now I am working in small software form as software tester. I have 2 + year experience in manual testing. Now I wan to change company. Plz told me is there any effect that I can not have any degree although I have 2 + experience ?

0 Answers  

---

can anyone tell me process of how the bugs r reported by testers??n after reporting bugs is the work of test engineer finished or still he has to do any thing????

1 Answers  

---

What is an inspection in software testing?

0 Answers  

---

What r the different types of testcase techniques?

15 Answers  

---

What are the main points to cover in system test report? What are all the points should consider while reviewing a test report?

2 Answers   Logica CMG,

---

---

hi what is difference between sdlc and stlc.

7 Answers   iSoft,

---

any one can explain error guessing..?it depends on validation or functional testing? give one example ..?

3 Answers  

---

How do u approach for testing a web application?

2 Answers  

---

What is Data base testing in manual

2 Answers   EDS,

---

Difference between regression testing and re-testing

5 Answers   Value Labs,

---

How do you go about testing a web application?

2 Answers  

---

How do u avoid redundant test cases?

1 Answers   Aspire,

---