Answer / dheeraj shandilya

McCabe's cyclomatic complexity(M) is given by:
M=L-N+2P
where L= no. of links in flowgraph
N= no. of nodes in flowgraph and
P= no. of connected component
(or no. of disconnected parts of flowgraph)
In graph theory, a connected component of an undirected
graph is a subgraph in which any two vertices are connected
to each other by paths, and which is connected to no
additional vertices. For example, see slide no 21(40) of

www.cs.drexel.edu/~spiros/teaching/SE320/slides/metrics.ppt

What are the different ways to check a date field in a website?

0 Answers  

---

can u merge 10GUI map files into a single GUI map file in winrunner?

0 Answers   QA,

---

What is Tracibility matrix?How we can use in real time application?

3 Answers  

---

TELL ABOUT CMM & ISO LEVELS ? its URGENT plz

4 Answers  

---

what and how to do application testing?

2 Answers  

---

tell wat u did in ur banking project?

0 Answers   Interra IT,

---

What should be done after writing test cases?

6 Answers   iSoft,

---

What can be the possible Test Cases for an Admin Control Panel in a Web Application

3 Answers  

---

why do testing are divided into stages primarily becoz: 1) different stage has different purpose 2)Stages makes the testing simpler 3)Different test run in different environments 4)The no of stages the testing is easier Which is the option need to be chosen its urgent

3 Answers  

---

Write down the template for test case.

5 Answers   Hexaware, IBM, Infotech, Wipro,

---

is test data the same as test condition

2 Answers  

---

what is testing methodology

3 Answers   Wipro,

---