Discussion
What is cyclomatic complexity used to measure ?
Answer: B
Cyclomatic complexity measures code complexity and the number of independent paths.
McCabe's cyclomatic complexity is computed from the control flow graph:
\[ V(G) = E - N + 2P \]
where E is the number of edges, N the number of nodes and P the number of connected components. For one routine it equals the number of decision points plus one. It gives the number of linearly independent paths, and so the minimum number of test cases for basis path testing.
It does not measure code size (lines of code), execution time or memory usage.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development