Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...


What is cyclomatic complexity?

Answers were Sorted based on User's Feedback



What is cyclomatic complexity?..

Answer / mfsi_chinmayb

Hi,
Cyclomatic complexcity is a methodology to measure the
complexity at a certain area of code.In other words it an
another way to reach at defect clustering.
Cyclomatic complexity is to measure the number of
independent paths in a program's source code.
The formula it follow: M = E- N + 2P
where

M = cyclomatic complexity
E = number of edges of the graph
N = number of nodes of the graph
P = the number of connected components.

**The easier one is like:n(umber of Decision statements in
the program being tested plus one.)
It provides the degree of testing/review required in a
certain area of code.

Is This Answer Correct ?    1 Yes 0 No

What is cyclomatic complexity?..

Answer / vidya

Cyclomatic complexity is a software metric (measurement).
It was 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. It is computed using a graph that describes
the control flow of the program. The nodes of the graph
correspond to the commands of a program. A directed edge
connects two nodes if the second command might be executed
immediately after the first command.


Definition

M = E &#8722; N + 2P

where

M = cyclomatic complexity
E = the number of edges of the graph
N = the number of nodes of the graph
P = the number of connected components.

"M" is alternatively defined to be one larger than the
number of decision points (if/case-statements, while-
statements, etc) in a module (function, procedure, chart
node, etc.), or more generally a system.

Separate subroutines are treated as being independent,
disconnected components of the program's control flow graph.

Is This Answer Correct ?    1 Yes 1 No

What is cyclomatic complexity?..

Answer / rahat menon

cyclomatic complexity is one practised by phsyco people ...
it is a way to find out how complex dat person is ..

scientist who r making research on this has gone mad n
pissed ..

Is This Answer Correct ?    0 Yes 0 No

What is cyclomatic complexity?..

Answer / guest

RAHAT

Your Psycho spelling wrong. I have a feeling you are the
psyco. Since you are messing with wrong thing.

Is This Answer Correct ?    0 Yes 0 No

Post New Answer

More QA Concepts Interview Questions

What is the difference between quality assurance (qa) and quality control (qc)?

0 Answers  


is possible smart identification through descriptive Programing

0 Answers  


How you will begin to improve the QA process?

0 Answers  


What are the Blackbox Testing Techniques?

2 Answers  


Give examples of boundary value and equivalence partitioning test cases.

2 Answers  


What happens if the time taken to complete a task requires 30 days but u r given only 10 days

12 Answers   IBM,


What is Cause and Effect Diagram, how it helps in software testing?.

2 Answers  


What is test idea? What is tets plan?

3 Answers  


How does the Internal QA Audit relates with the ISO Standards level ?

0 Answers   QA,


Define the role of qa in software development?

0 Answers  


How do you define a format of writing a good test case?

0 Answers  


Explain the difference between quality control and quality assurance.

0 Answers  


Categories