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 are the validation check u generaly do in a Banking log-in form in security point of view..?

3 Answers   HCL,

---

Hi friends!! Can u tell me, what is meant by Database Testing? How it can be done? What is tested in it(like any Queries like Select and all are tested or not)?

3 Answers   IBM,

---

what are the advantages of manual and automation testing ? and which one would u term as efficent testing and effective testing ?pls do reply thankx in advance its urgent

4 Answers   HCL,

---

what do u like in QA?

4 Answers   Millennium,

---

What were the major challenges u faced while testing

0 Answers   CMC, Infosys, TCS,

---

How do you perform configuration management with typical revision control systems?

0 Answers   3i Infotech,

---

What are the challenges you faced in your project (Testing) and in your company?

0 Answers   Axis Bank,

---

1. What are your overall impressions of the Web site?

0 Answers  

---

What is the full form of cmmi?

0 Answers  

---

If you have 2 versions of a software (v1.0 & v1.1) and you are testing v1.0. How do you confirm that the defects found in v1.0 have been fixed and have not migrated to v1.1 ?

3 Answers   BN, Indi Shopee, Symphony,

---

What is state transition?

0 Answers  

---

Who will do the Effort Estimation and Scheduling ?

2 Answers   IBM,

---