Question: Draw a control flow graph for the following sample code. Determine the cyclomatic complexity of the graph. (a) sum_of_all_positive_numbers (a, num_of_entries, sum) (b) sum =
Draw a control flow graph for the following sample code. Determine the cyclomatic complexity of the graph.
(a) sum_of_all_positive_numbers (a, num_of_entries, sum) (b) sum = 0 (c) init (d) (e) (f) (g) 1 while (init 0 sum sum +a[init]]] endif init init + 1 endwhile = (h) end sum_of_all_positive_numbers
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
