Historical syllabus topic · This subject is outside the current GATE syllabus.
Consider the following statements about the cyclomatic complexity of the control flow graph of a program module. Which of these are TRUE?
- The cyclomatic complexity of a module is equal to the maximum number of linearly independent circuits in the graph.
- 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.
- The cyclomatic complexity can also be used as a number of linearly independent paths that should be tested during path coverage testing.
View answer
Answer: B
Worked explanation not available yet.
Free practice · Your answers on this page are not saved.