Answer Posted / 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?

1111

---

Actually by using severity you should know which one you need to solve so what is the need of priority?

1172

---

Can any1 tell me suppose u r doing manual testing on unix platform with Shell Script, then how it is done? How u r implementing it & what is the use of Shell scripting on Manual Testing?

3888

---

what are metrics and what are metrics did u collect in you are project

2307

---

Define brain stromming and cause effect graphing?

1117

---

what risks do u faced u r projest how do you solve

2079

---

Test cases have written according to Flow of the software working or according to Screens?

1892

---

What is stub?

1182

---

what is the diff. bw separate database testers and manual testers with sql knowledge guys... iam confusing so much ,,in cmpny database testers are not working on manual..? both positions are same are not? explian clesly with example? thank u

2139

---

what is the test plan of facebook?

2923

---

Does an increase in testing always improve the project?

1770

---

Scenario-based testing Option 1 concentrates on actor and software interaction Option 2 misses errors in specifications Option 3 misses errors in subsystem interactions Option 4 Both 1 abd 2

3486

---

About Testing

2352

---

What is the test harness?

1063

---

What is mutation testing & when can it be done?

1103

---