For the question 2, we were given a code and were asked to make a flow graph, calculate the cyclomatic complexity, identify and list down all independent paths, and design a test case for the code using the table given. We first look up and understand the code given and refers to the slides to ensure there's no mistakes in making the flow graph as it would affect other questions. Then after agreeing on the flow graph we proceeds calculating the cyclomatic complexity using the formulas, identify the paths and designed the test cases for the code.
