Closed RexxarAng closed 1 year ago
CFG https://drive.google.com/file/d/1yp14kRDD9zq6fVEa9A64jzXB-yYinuYN/view?usp=sharing
Code for job allocation
Cyclomatic Complexity = E - N + 2P = 40 - 32 + 2(1) = 10
Determine a set of basis paths
Steps
Determine a set of basis paths
Steps
Path 1: 1-2-3-32
Path 2: 1-2-4-5-32
Path 3: 1-2-4-6-7-8-9-10-11-12-14-15-16-17-18-19-20-32
Path 4: 1-2-4-6-7-8-9-10-11-12-14-15-16-17-18-19-21-23-24-25-26-27-18-29-30-31-32
Path 5: 1-2-4-6-7-8-9-10-11-12-14-15-16-17-18-19-21-23-24-25-26-27-18-19-21-22-26-27-18-29-30-31-32
Path 6: 1-2-4-6-7-8-9-10-11-12-14-15-16-17-18-19-21-23-24-25-26-27-18-19-21-22-26-27-18-19-21-22-26-27-18-19-21-22-26-27-18-19-21-22-26-27-18-19-21-22-26-27-18-19-21-22-26-27-18-19-21-22-26-27-28-32
Path 7: 1-2-4-6-7-8-9-10-11-12-14-15-16-17-18-19-21-23-24-25-26-27-18-19-21-22-26-27-18-19-21-22-26-27-18-19-21-22-26-27-18-19-21-22-26-27-18-19-21-22-26-27-18-19-21-22-26-27-18-19-21-22-26-27-18-29-30-31-32
Path 8: 1-2-4-6-7-8-9-10-11-12-14-15-16-17-18-29-30-31-32
Path 9: 1-2-4-6-7-8-9-8-12-13-32
Path 10: 1-2-4-6-7-8-12-13-32
Test Cases
This section should include a suitably complex method from a class inside your system. The code representation of this class can be pseudocode (logically correct and translatable into actual code) or actual code. You are expected to show CFG, Complexity and use basis testing to achieve appropriate coverage for your test cases, as well as a set of test cases which address each path identified