in IS&Software Engineering retagged by
4,650 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
in IS&Software Engineering retagged by
4.7k views

2 Comments

II and III are true statements about the cyclomatic complexity of a control flow graph.
0
0

1 Answer

7 votes
7 votes
ans: b) 2 and 3

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

4 Comments

Sorry. Corrected now :)
1
1

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

0
0
Answer:

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