The GATE Grind

GATE 2009 CS – Question 50

Software Engineering · Modular Software Design · 2 marks · Multiple choice

Which statements about a module control-flow graph’s cyclomatic complexity are TRUE?

I. It equals the maximum number of linearly independent circuits in the graph.

II. It is the number of decisions plus one, where any conditional statement is a decision.

III. It gives the number of linearly independent paths to test in path-coverage testing.

  1. I and II
  2. II and III
  3. I and III
  4. I, II and III

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (B) II and III

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Modular Software Design questions

All Modular Software Design questions →