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

Can you please explain about the erp project

1854

---

is it possible web application make it as executable file

2481

---

Define cause effect graphing?

1121

---

What are tools of performance testing?

1269

---

what are all the possible Test Cases for VoIP based applications

1769

---

How to find that tools work well with your existing system?

2077

---

Is Anyone attended the manual testing interview with capgemini in recent past. please let me know the type of questions they can ask. Thanks

3348

---

Hello testers I am an Bsc Hotel mgmt Degree holders but now am doin my software testin programme, side by MCA Master degree an have 6 months exp i testing in company.. i want to change my CV according IT based. so can anyone help me with sendin any sample CV of urs.. do me this favour it wil be very helpful for me prepare CV for interviews....

2135

---

Explain the strategy for testing a Java application?

2164

---

can somebody plz tel me about financial domain for manual tester?? which kind of application use and what is the approach of testing??

1899

---

Differentiate test bed and test environment?

2623

---

What is the difference between SIT AND IST?

3263

---

What is the big deal about ‘requirements’?

1312

---

what are the templates for daily,weekly and monthly reports? plz reply ASAP.

2117

---

Once automated, what are the types of functionality provides the highest Return On Investment (ROI) to the company?

11253

---