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

I m having SRS.In Manual Testing,how am I going to decide whether to pass particular test case or not from that SRS??

1 Answers  

---

What is mean by bug? how its gets injected into application?

4 Answers  

---

What is Trivial Bug?

2 Answers  

---

What are the advantage and disadvantage of Selenium IDE tool? Is that useful for testing .net projects? please reply my friends.

6 Answers  

---

what is Persistent Testing.

3 Answers   Tera Informatics,

---

HOw to give special characters to password

3 Answers  

---

Questions were asked on Stubs, Drivers, Top down Integration, Bottom Up Regression

3 Answers   RBS,

---

What is Prototype Testing?

5 Answers   Wipro,

---

What is a Use case? Is it possible to write test case without Use case?

2 Answers  

---

what is the format of test report?

2 Answers  

---

what is cookies. how do we test the cookies

2 Answers  

---

Hi, this is murthysharma. I need very urgently about some terms which are used in use cases? Plz give reply to me, if any body know, It is really very very urgent. 1. what is the difference between basic flow,exception flow and alternative flow? 2.what are non-functional requirements in use cases? 3.what are exceptions, special requirements, business rules, assumptions, constraints. Kindly give me with the example. Bcoz, I am very new to this use cases. thanks in Advance. Regards, M.MurthySharma

0 Answers   Infosys,

---