Testing Basics - What is Cyclomatic complexity

GeekInterview.com > Interview Questions > Testing > Testing Basics

Go To First | Previous Question | Next Question

Testing Basics | Question 153 of 203

What is Cyclomatic complexity

Total Answers and Comments: 8

Last Update: January 09, 2007 Asked by: kalpana

Sponsored Links

Best Rated Answer

—

No best answer available. Please pick the good answer available or submit your answer.

November 01, 2006 12:23:19

Subbu4testing

Member Since: October 2006 Contribution: 25

RE: What is Cyclomatic complexity

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

Cyclometri complxity number of decisions+1

Is this answer useful? Yes | No

November 02, 2006 04:43:54

jainbrijesh

Member Since: September 2006 Contribution: 1193

RE: What is Cyclomatic complexity

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.

Is this answer useful? Yes | No

November 09, 2006 04:38:40

Lalitha Karthik

RE: What is Cyclomatic complexity

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

Is this answer useful? Yes | No

November 21, 2006 03:48:53

laxman

RE: What is Cyclomatic complexity

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'

Is this answer useful? Yes | No

December 13, 2006 04:47:42

bharathi

RE: What is Cyclomatic complexity

To find the independent paths in a program file

Is this answer useful? Yes | No

December 14, 2006 09:21:30

santosh sunkoji

RE: What is Cyclomatic complexity

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

Is this answer useful? Yes | No

December 21, 2006 05:43:38

G.D.S.Prasad

Member Since: November 2006 Contribution: 191

RE: What is Cyclomatic complexity

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

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

Regards

Prasad

Is this answer useful? Yes | No

January 09, 2007 10:34:02

Sujatars

Member Since: December 2006 Contribution: 217

RE: What is Cyclomatic complexity

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

Is this answer useful? Yes | No

Go To Top

User Name		Remember Me?
Password

Question Bank