Discussion
A procedure has 12 basic blocks and 15 edges in its flow graph. What is its cyclomatic complexity, computed as edges minus nodes plus two?
Answer: B
Fifteen minus twelve plus two gives five. The measure counts the independent paths through the procedure and is often used as a rough guide to how hard the code will be to test. It also bounds the number of paths a data flow analysis must account for.
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