What is Cyclomatic complexity

  • Interview Candidate
  • 20
  • 2814

Showing Answers 1 - 20 of 20 Answers

Subbu4testing

  • Nov 1st, 2006
 

Cyclometric complexityt is number of indipendent paths through the program.It gives complexity of the code.

Cyclometri complxity=number of decisions+1

  Was this answer useful?  Yes

jainbrijesh

  • Nov 2nd, 2006
 

It's calculated for doing white box testing. It's done by making a control flow diagram.It is a measure of the complexity of a software module,and equal to (e - n + 2). where e is the number of edges in the control flow graph :and n is the number of nodes in this graph ;It tells about no. of independend paths in a program code.

  Was this answer useful?  Yes

Lalitha Karthik

  • Nov 9th, 2006
 

Cyclomatic complexity gives the number of independant paths in a Program,its denoted by a Number

  Was this answer useful?  Yes

laxman

  • Nov 21st, 2006
 

During BASIS PATH TESTING,programmers run the programme more than one time on all possible individual paths to detect run time errors. These no.of individual paths is called as 'CYCLOMATIC COMPLEXITY'

  Was this answer useful?  Yes

bharathi

  • Dec 13th, 2006
 

To find the independent paths in a program file

  Was this answer useful?  Yes

santosh sunkoji

  • Dec 14th, 2006
 

Cyclomatic Complexity is a software metric that provides a quantitative measure of the logical complexity of a program

  Was this answer useful?  Yes

G.D.S.Prasad

  • Dec 21st, 2006
 

Hi,

A measure of the logical complexity of an algorithm, used in white-box testing.

Cyclomatic complexity, V (G), for a flow graph G is equal to

  1. The number of regions in the flow graph.
  2. V (G) = E - N + 2 where E is the number of edges and N is the number of nodes.
  3. V (G) = P + 1 where P is the number of predicate nodes.

Regards

Prasad

  Was this answer useful?  Yes

Sujatars

  • Jan 9th, 2007
 

 

Cyclomatic Complexity is number of decision statement plus one.

Given any computer program, draw its control flow graph, G, where each node corresponds to a

block of sequential code and each edge corresponds to a branch or decision point in the program.

The cyclomatic complexity of such a graph can be computed by a simple formula from graph

theory, as v(G)=e-n+2, where e is the number of edges, and n is the number of nodes in the graph

  Was this answer useful?  Yes

Give your answer:

If you think the above answer is not correct, Please select a reason and add your answer below.

 

Related Answered Questions

 

Related Open Questions