PUERTA | PUERTA-CS-2009 | Pregunta 50

Considere las siguientes afirmaciones sobre la complejidad ciclomática del gráfico de flujo de control de un módulo de programa. ¿Cuáles de estos son VERDADEROS?

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 a number of linearly 
     independent paths that should be tested during path coverage testing. 

(A) I y II
(B) II y III
(C) I y III
(D) I, II y III

Respuesta: (B)
Explicación:

TRUE: 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.
TRUE: The cyclomatic complexity can also be used as a number of linearly 
     independent paths that should be tested during path coverage testing. 

Cuestionario de esta pregunta