Рубрики

ВОРОТА | GATE-CS-2009 | Вопрос 50

Рассмотрим следующие утверждения о цикломатической сложности графа потока управления программного модуля. Какие из них являются ИСТИННЫМИ?

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. 

(А) I и II
(B) II и III
(С) I и III
(D) I, II и III

Ответ: (Б)
Объяснение:

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. 

Тест на этот вопрос

Рекомендуемые посты:

ВОРОТА | GATE-CS-2009 | Вопрос 50

0.00 (0%) 0 votes