Consider the following statements about the cyclomatic complexity of the…
PYQ GATE 2009
Consider the following statements about the cyclomatic complexity of the control flow graph of a program module. Which of these are TRUE?
I. The cyclomatic complexity of a module is equal to the maximum number of linearly independent circuits in the graph.
II. The cyclomatic complexity of a module is the number of decisions in the module plus one, where a decision is effectively any conditional statement in the module.
III. The cyclomatic complexity can also be used as the number of linearly independent paths that should be tested during path coverage testing.
- A.
I and II
- B.
II and III
- C.
I and III
- D.
I, II and III
Attempted by 119 students.
Sign up free to check your answer
Sign up freeLoading lesson…

