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

whenever the requirements are not given by the customer what type of testing you do?

2 Answers   Subex,

---

what is independent question and what is retriewing and what is problem of severity.

1 Answers  

---

What is the difference between Product-based company and Projects-based company?

22 Answers   CTS, Google, Wipro,

---

what is negative testing and positive testing with example?

2 Answers  

---

What is heuristic checklist used in Unit Testing?

1 Answers  

---

Hi.....wat r d major bugs we can find in banking domain???

1 Answers  

---

for example, if we have a textbox ranging from 0-100. which methodology we are using & what are inputs we are observed?

1 Answers   Semantic Space,

---

How does quality control differ from quality assurance?

1 Answers  

---

Explain the test plan, how to prepare the test plan

3 Answers   EDS,

---

Write Test cases on pen?

2 Answers   Cap Gemini, PanTerra,

---

ur trying 2 get hotmailpage,while u give www.hotmail.com.page "The page not found"is displayed, for what u will be look for next ?

1 Answers  

---

What is bug release?

1 Answers  

---