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

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 (59.4k points)
retagged by | 832 views

1 Answer

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

In 1, it should be "path" and not "circuit".
answered by (465 points)
edited by
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".

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.


Related questions

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

35,499 questions
42,764 answers
42,150 users