what is cyclomatic complexity? plz explain with example
- 17 Answers
- 71737 Views
- Accenture, I also Faced
- E-Mail Answers
Answer Posted / 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
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
How do your characteristics compare to the profile of the ideal manager that you just described?
what exactly is heuristic checklist approach for unit testing?
whta is compile module?
What are the various test case for google analytics, api keys , pay pal if you know please post me a answer. And how we will test
Wat type of questions ll be asked in interview for an 1-2 yrs. experinced persond and i need some database concept question in testing.
How soon the bug should get fixed?
What are some best practices that you should follow when writing test cases?
What a team leader will test first when s/he will get new module to test?
What is the difference between a bug, a defect and an error?
Risk Analysis a) 2 step, b)3 step, c) 4 step, d) 6 step
What are the different ways to check a date field in a website?
What are the advantages of automation over manual testing?
Do submit teststrategy to customer if yes at what time
Which of these techniques is not useful for partition testing at the class level Option 1 attribute-based partitioning Option 2 category-based partitioning Option 3 equivalence class partitioning Option 4 state-based partitioning
Why would we not include these?
