retagged by
4,704 views
5 votes
5 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
retagged by

1 Answer

7 votes
7 votes
ans: b) 2 and 3

In 1, it should be "path" and not "circuit".
edited by
Answer:

Related questions

14 votes
14 votes
4 answers
1
go_editor asked Sep 29, 2014
12,112 views
The cyclomatic complexity of each of the modules $\text{A}$ and $\text{B}$ shown below is $10.$ What is the cyclomatic complexity of the sequential integration shown on t...