The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+4 votes
530 views

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

  1. The cyclomatic complexity of a module is equal to the maximum number of linearly independent circuits in the graph.
  2. 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.
  3. The cyclomatic complexity can also be used as a number of linearly independent paths that should be tested during path coverage testing.
    1. I and II
    2. II and III
    3. I and III
    4. I, II and III
asked in IS&Software Engineering by Veteran (69k points)
retagged by | 530 views

1 Answer

+5 votes
Best answer
ans: b) 2 and 3

In 1, it should be "path" and not "circuit".
answered by Junior (527 points)
edited by
explanation??
What is the meaning of 1st statement?

It is just the definition of cyclomatic complexity. Problem with first statement is that "circuit" is used in place or "path". 

http://cs.gmu.edu/~dfleck/classes/cs421/fall07/slides/CyclomaticComplexity.ppt

thanks Arjun, but link is not working.
Sorry. Corrected now :)

NOTE: the decision node should have only 2 paths one for yes and one for no to use this formula.



Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

33,687 questions
40,230 answers
114,268 comments
38,795 users