Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

GATE | GATE-CS-2009 | Question 50

  • Last Updated : 28 Jun, 2021

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 a 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


Answer: (B)

Explanation:

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

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. 


Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :