Problem 1

Statement Coverage (Refer to table below)

Branch Coverage (Refer to table below)

Path Coverage (Refer to table below)

All statements: line 2, line 5, and line 7

All Branches: a, b, c, d, e, f, g

All possible paths:

• A → B → C
• A → B → D → G
• A → D → E → F
• A → D → E → G
• A → D → G

Impossible paths (having them require a > 0 and a < 0 to happen at the same time):

• A → B → D → E → F