Answer Posted / nitin verma

Hi,
In the cyclometric complexity we find the best shortest
path to reach to the destination node.the formula for this
is

V(g)=e-n+2p

g= graph
e= edges
n= nodes

plz correct me if i m wrong...
nitin9360@gmail

Why we have to do manual testing?

1700

---

Describe to me what you see as a process. Not a particular process, just the basics of having a process.

2178

---

What is bug leakage?

1195

---

What are cookies?

1113

---

Login screen with Username, Password input fields,remember me check box,sign in and reset button write Test Cases for GUI, Funcitonal, Negative, Usability and Security testing.

2844

---

What are microsoft 6 rules?

1224

---

What are the bugs we cannot find in black box?

1192

---

Have you worked in UDAP (Credit Card act 2009) project?What did you test in Billing & Payment modules?

2198

---

what is the difference between website and web based application ?

2783

---

Hi friends, currently i am working with banking domain project in the part of testing..what kind of questions will be ask at interviews.. can anybody listout the project oriented questions which are asked in interviews...

3920

---

1. Give me an example of something you tried at work but did not work out so you had to go at things another way. can somebody give a real time example

2464

---

I have an Interview about Guidewire claimcenter,so could you provide any info regd it?.I would really appreciate any kind of help- email at hvshah2001@gmail.com

2481

---

Write 10 test scenarios to test remember me checkbox present in login window

1584

---

What does entry and exit criteria mean in a project?

1155

---

1.what is a test condition ?

2085

---