What is the difference between path coverge and cyclomatic complexity?

  • Interview Candidate
  • 3
  • 3559

Showing Answers 1 - 3 of 3 Answers

karpagam.

  • Oct 24th, 2009
 

Cyclomatic complexity gives the number of independent paths in the program, which should be tested.
We can find the cyclomatic complexity by representing the program as flowgraph notation or writing the program in procedural language.

Path coverage is the process of writing and executing the test cases that executes all the independent paths.

  Was this answer useful?  Yes

Give your answer:

If you think the above answer is not correct, Please select a reason and add your answer below.

 

Related Answered Questions

 

Related Open Questions