Three methods:

# of Enclosed spaces in the graph |E| - |V| + p #of conditions + 1

Problem Descriptions: The purpose of this assignment is to reinforce the material on program graphs from lecture. For each of the four problems below: (15 pts) 1. Draw the program graph. You must use line numbers to label all nodes in the graph. Do not use the statements or statement fragments themselves as nodes labels (5 pts) 2. Compute the cyclomatic number using each of the three methods discussed in class. Show your work. (5 pts) 3. Calculate the P* using the given conditions under each problem. Show your work. Problem 3: 1void 03(0 S1; if(C11IC2) S2; do S3; )while(C3) S4 9 10 else( S5; 12 13 14 15 16 17 S6; S7; For P, suppose the do loop defined by Line 5 may be executed anywhere from 1 to 3 times