Question: Consider a program for classification of a triangle. Its input is a triple of positive integers (say a, b and c) from interval [1, 100].
Consider a program for classification of a triangle. Its input is a triple of positive integers
(say
a, b and
c) from interval [1, 100]. The output may be one of the following:
[Scalene, Isosceles, Equilateral, Not a triangle, invalid inputs]
(a) Draw a program graph, DD path graph and write test cases for every independent path.
(b) Find all du-paths and identify those du-paths that are not dc paths. Write test cases for every du-path.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
