Answer Posted / nitin verma

In the Cyclometris Complexity we find the shortest path
between the nodes.The formula is
V(G)=e-n+2p where,

G= Graph
e= no. of edges
n= nodes
p= no. of paths

plz Correct me if i m wrong....

nitin9360@yahoo.com

How to test the below code and write test case? Prove that this code is wrong? int add(int a ,int b) {return a+b; }

1986

---

How to test whether the application is having memory leakage using task manager and PerfMon. Please tell if any one know. thanku

1957

---

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

1159

---

6 what do you like least about testing?

2156

---

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

7814

---

What about the test case if the field only takes a certain number of characters or a minimum number?

1122

---

What is a code walk through?

1064

---

Explain the strategy for testing a Java application?

2091

---

what is configuration management tool - send to thanu_santo@rediffmail.com. what is testing senarios

2311

---

What if the project isn’t big enough to justify extensive testing?

1239

---

What are the types of maintenance?

1098

---

When first time we are testing the screen then we have to write that this screen should contains so & so columns [ suppose there r 10 columns on that screen]in the expected result

1731

---

What is bug priority?

1289

---

1.what is a test condition ?

1989

---

i want manual and automation test cases and interview questions

2145

---