Discussion
Which one of the following statements is incorrect ?
Answer: B
For a flow graph, cyclomatic complexity is V(G) = E - N + 2, with E the number of edges and N the number of nodes. It is also P + 1, with P the number of predicate nodes, and it equals the number of regions of the graph. So statements (A), (C) and (D) are correct. Statement (B) gives V(G) = N - E + 2, with the terms reversed, which would be negative for most graphs, so it is the incorrect statement. The answer is option (B).
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