Q50

MCQ2 marks, −0.67

Consider the following statements about the cyclomatic complexity of the control flow graph of a program module. Which of these are TRUE?

(A)

The cyclomatic complexity of a module is equal to the maximum number of linearly independent circuits in the graph.

(B)

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.

(C)

The cyclomatic complexity can also be used as a number of linearly independent paths that should be tested during path coverage testing. I and II II and III I and III I, II and III

Loading…