Answer Posted / err. nilesh

cylomatic complexity is technique used to find out the path
coverage.Mathematically, the cyclomatic complexity of a
structured program[note 1] is defined with reference to the
control flow graph of the program, a directed graph
containing the basic blocks of the program, with an edge
between two basic blocks if control may pass from the first
to the second. The complexity M is then defined as:[2]

M = E − N + 2P

where

E = the number of edges of the graph
N = the number of nodes of the graph
P = the number of connected components

what is coupling integration testing

2213

---

Is there any procedure of web-site development in manual testing. If yes what are factors we should test?

2444

---

Have you ever completely tested any part of a product? How?

2506

---

How do you go about testing a project?

2076

---

What is a test server?

1341

---

wat are the questions would the project leader ask about the project?? please do send the answers early.

8140

---

What are the properties of a good requirement?

2109

---

What are the main key components in web applications and client and server applications? And explain the differences between them?

1281

---

Hello again!! wanted to ask you HOW EXACTLY create stubs and driver in integration testing? 2.whats the difference between integration testing and system integration testing? Thanks!!

2231

---

What is a defect?

1235

---

My name is Akpos from Nigeria. I have finished manual testing course. Please, can someone advise me where to go on from here?

1093

---

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

1298

---

Hi Friends, I want to know the best institute in hyderabad which is giving training in 'SAP Testing' and who is the best faculty. Regards, Imtiyaz..

3274

---

Give the real-time example for back-to-back testing?

1920

---

When should you opt for manual testing over automation testing?

1270

---