You are not logged in.

#1 2015-06-04 05:26:25

User RankUser RankUser RankUser RankUser RankUser Rank
From: Chichawatni,Pakistan
Registered: 2014-10-03
Posts: 8,129

Cyclomatic Complexity:

Three statements about the cyclomatic complexity of the control flow graph as a program module are given below:
I) The cyclomatic complexity of a modules level to maximum number of linear independent circuits in a graph.
II) The cyclomatic complexity of a module is the addition of the number of number of decisions in the module and the one where a decision is effectively any conditional statements in the module.
III) The cyclomatic complexity can also be used as number of linearly independent paths that should be tested during path coverage testing.
The statements that hold true for the cyclomatic complexity is:

Option A):
I and II
Option B):
II and III
Option C):
I, II and III
Option D):
I and III

Correct Answer is Option B):
II and III

You cannot discover the new oceans unless you have the courage to lose the sight of the shore.

2015-06-04 05:26:25

Ads By Google

Re: Cyclomatic Complexity:

Board footer