GATE | CS | 2009 | Software Engineering | Question 50

Last Updated :
Discuss
Comments

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.

I and II

II and III

I and III

I, II and III

This question is part of this quiz :

GATE-CS-2009,Software Engineering,Software Engineering GATE CS PYQ Quiz
Tags:
GATE
Computer Science Quizzes
GATE CS
Software Engineering
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy