Answer / deep singh kushwaha

Cyclomatic complexity is a software metric (measurement) developed by Thomas McCabe and is used to measure the complexity of a program. It directly measures the number of linearly independent paths through a program's source code.
One of the ways is counting the number of closed loops in the flow graph, and incrementing the number by one.
i.e.
M = Number of closed loops + 1
where
M = Cyclomatic number.
Implications for Software Testing
M is a lower bound for the number of possible paths through the control flow graph.
M is an upper bound for the number of test cases that are necessary to achieve a complete branch coverage.
For example, consider a program that consists of two sequential if-then-else statements.
if (c1) {
f1();
} else {
f2();
}
if (c2) {
f3();
} else {
f4();
}
To achieve a complete branch coverage, two test cases are sufficient here.
For a complete path coverage, four test cases are necessary.
The cyclomatic number M is three, falling in the range between these two values, as it does for any program.

please suggest me if i m wrong..
e-mail-deepsingh.154@gmail.com

Answer / err. nilesh

cylomatic complexity is technique used to find out the path
coverage.Mathematically, the cyclomatic complexity of a
structured program[note 1] is defined with reference to the
control flow graph of the program, a directed graph
containing the basic blocks of the program, with an edge
between two basic blocks if control may pass from the first
to the second. The complexity M is then defined as:[2]

M = E − N + 2P

where

E = the number of edges of the graph
N = the number of nodes of the graph
P = the number of connected components

Answer / rahul

it is used to find out no. of independent path in graph.

v(g)=e-n+2p

v(g)=cyclomatic complexity of graph g
e=no.of edges in th graph
n=no. of node in tha graph
p=no.of connected component in the graph

Answer / nitin verma

In the Cyclometris Complexity we find the shortest path
between the nodes.The formula is
V(G)=e-n+2p where,

G= Graph
e= no. of edges
n= nodes
p= no. of paths

plz Correct me if i m wrong....

nitin9360@yahoo.com

Answer / karthikraj

Its a Whitebox technices
In this we findout the total number of paths......

Answer / rf

,.

Answer / praveen kumar

Number of Decision Statements - 1

Q) If pseudo code below a programming language. what test case s are required to achieve 100% statements coverage If x=3 then display_message x; If y=2 then display_message y; else display_message z; else display_message z;

1 Answers   Capital IQ,

is integartion tetsing done by..... a.test eng b.developer c.both d. none.. if any body involves , wat will they do?

8 Answers   Accenture,

Tell me about CMM LEVEL -4 …what are steps that to be followed to achieve the CMM -IV standards?

1 Answers   AZTEC, Virtusa,

Explain about 'Interface Testing' in Web based Application?

1 Answers   Crea,

I want to know all detail of v model phases

3 Answers  

From which document we will get Technical Requirements ?

4 Answers   IBM,

Write TestCases for mobile

2 Answers   Philips,

What are the difference between Water fall model and V- Model? Which one is better? Why 80% of Software companies using Water fall model nowadays?

5 Answers   iGate,

Which metric is used for extent of testing? a.)User Participation b.)Acceptance criteria tested c.)Test Cost d.)Test Automation

1 Answers   Amdocs,

what is the difference between sanity and smoke testing?

11 Answers  

What is the difference between load testing and performace testing?

0 Answers   Infosys,

Can anyone please answer the below question on Manual Testing: Tell me about atleast 5 bugs you come across in your last testing?

0 Answers   United Healthcare,