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

can any one give negative testcases for calculator

3 Answers  

---

can any help the difference b/w incremental integration testing & integration testing & system & funtional testing

1 Answers  

---

What are the roles of glass-box and black-box testing tools?

0 Answers   CTS,

---

What is JAVA Testing, what we do in That ?

2 Answers  

---

Hi can anyone Explain smoke testing with real time examples

3 Answers   Student,

---

---

Can anybody explain me branch/decision coverage with a example.

1 Answers  

---

What was a problem you had in your previous assignment (testing if possible)? How did you resolve it?

0 Answers  

---

what is v model need clear explanation with advantages and disadvantages?

3 Answers  

---

Can any one tell project questions related to testing

0 Answers  

---

What is meant by Poty testing?

2 Answers   Spectramind,

---

what is diff bet project and product testing?What is difference between client server application and web server application

5 Answers   InfoBeans, pspl,

---

what is metrices?

2 Answers  

---