Interested to Buy Any Domain ? << Click Here >> for more details...
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
| Is This Answer Correct ? | 2 Yes | 0 No |
Post New Answer View All Answers
hi what are the test cases for web application..i need these example..please..mail me at mina_ims@yahoo.com
how will u create diff types of scenario for any website?
Hi, Anybody knows about Hexaware company..
why testcases are written and what is the importance?
Describe to me what you see as a process. Not a particular process, just the basics of having a process.
What is the most important phase in STLC and Why
how agile testing is performed and what are the related documents.
i need manual testing interview questions for 2+ experience plzz help me..
What are the bugs we cannot find in black box?
What do you plan to become after say 2-5yrs (Ex: QA Manager, Why?)
What are the differences between stlc and sdlc?
Can Anbody please send me Daily Work status format in which I can save my daily work activity
hi this is chik here iam showing my current project ERP and am prepair in hr model please tell me details about it and what all function test in hr model and give me some test caserelated to this module.Please tell me am faceing lots of problem in interview am not able to explain in interview please help me out my id is chiku_69@yahoo.in
date format and we should 8 digits - not accepted only /accepted write how many in test cases in the date format valid , and in valid
What is test driver and test stub?
