Consider the following statements about the cyclomatic complexity of the control flow graph of a program module. Which of these are TRUE?
It is just the definition of cyclomatic complexity. Problem with first statement is that "circuit" is used in place or "path".
NOTE: the decision node should have only 2 paths one for yes and one for no to use this formula.
Can we challenge this question?