Question: For a program, it is possible that its McCabe complexity is higher than the number of possible execution paths in the program. Provide an example

For a program, it is possible that its McCabe complexity is higher than the number of

possible execution paths in the program. Provide an example to explain under which

scenario the statement on McCabe is true. Note that you need to provide a code

example, a short description such as drawing a simple CFG(control flow graph) and list the possible

execution paths.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!