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

What do you mean by SLC ?

5 Answers   CSC,

---

How do you determine what to test?

4 Answers  

---

What is Difference between White-box Testing and Unit testing?

6 Answers   AZTEC, College School Exams Tests,

---

Do you feel any dis-advantage over the current process? if he/she says any, have You discussed with your Manager reg this ? Why?

0 Answers  

---

explain the ISO standard ( more explanation about the ISO

0 Answers   ACIL, EDS,

---

what comments have u given in peer review? tell me at least 3 comments what u have given? july27 brahma412@yahoo.co.in

2 Answers   CTS,

---

Hi Friends, Please help me in providing System test cases examples Thanks in Advance

0 Answers  

---

what are the bugs we canot find in black box.

4 Answers  

---

can anybody tell me what is thread testing with a practical example,coz the defn is liitle complex it seems.

3 Answers  

---

1) how will you do validation testing in combo box ? (2)Suppose user does not want maximum length validation message, but when tester inserts data in textbox and it gets truncated, how will you resolve this issue ? (3)if a user inserts maximum number in quantity textbox in a PHP based web application then what result will show?

0 Answers  

---

diff between usecase and testcase

8 Answers  

---

what do u know about ERP , INSURANCE DOMAINS?

2 Answers   Bartronics, NDL, TCS,

---