Cyclomatic Complexity and Test Coverage in Sonar Qube

Must-share information (formatted with Markdown):

  • which versions are you using (SonarQube, Scanner, Plugin, and any relevant extension): I am not using Sonar Qube yet.
  • what are you trying to achieve: Understand dependencies between cyclomatic complexity and test coverage
  • what have you tried so far to achieve this: Research in the internet


I am working in the quality assurance and I have some questions on Sonar Qube.

So far, I understood that the cyclomatic complexity can be calculated according to Thomas J. McCabe. Furthermore, the test coverage can be calculated on different levels. These are

C0 = Statement coverage
C1 = Branch coverage
C2 = Path coverage
C3 = Condition coverage

Question 1: What is the differende between C0 nand C1?
Question 2: McCabe showed how to calculate the cyclomatic complexity and did not define C0, C1, C2 and C3, right?
Question 3: In Sonar Qube, I can calculate the cyclomatic complexity. This gives me the amount of test cases which is needed as a minimum for a C1 = Branch Coverage of 100%, right?
Question 4: Is the cyclomatic complexity used for monitoring, how many test cases I still need? I assume that I can see, which code is not yet covered and create unit tests accordingly, right?