Independent paths

1,2,3,13

1,2,4,5,13

1,2,4,6,7,8,13

1,2,4,6,7,9,10,13

1,2,4,6,7,8,11,13

1,2,4,6,7,9,11,12,13

#Cyclomatic Complexity

CC(G) = Number(17) - Number(13) + 2 = 6

CC(G) = Number of Nodes with a condition(5) +1 = 6

CC(G) = Number of regions(5) + 1 = 6

#Test Cases

Test Case 1

Inputs:120 40

Expected Outputs: Invalid input

Actual Outputs: Invalid input

java grades 120 40

Test Case 2

Inputs: 50 120

Expected Outputs: Invalid input

Actual Outputs: Invalid input

java grades 50 120

Test Case 3

Inputs: 38 50

Expected Outputs: Component fail

Actual Outputs: Component fail

java grades 38 50

Test Case 4

Inputs:50 38

Outputs:Component fail

Actual Outputs:Component fail

java grades 50 38

Test Case 5

Inputs: 50 55

Outputs: Fail

Actual Outputs: Fail

java grades 50 55

###Test Case 6

Inputs: 65 70

Outputs: Pass

Actual Outputs: Pass

java grades 65 70

Test Case 7

Inputs: 85 95

Outputs: Pass with distinction

Actual Outputs: Pass with distinction

java grades 85 95