Statics Measures Question:
Download Questions PDF

What is a cyclomatic complexity?

Answer:

Cyclomatic complexity is a complexity measure of code related to the number of ways there exists to traverse a piece of code. This measure determines the minimum number of test cases needed to test all the paths using linearly independent circuits.

Download Statics Measures Interview Questions And Answers PDF

Previous QuestionNext Question
What is statement coverage?How is cyclomatic complexity computed?