Design the test cases and test the program of Triangle problem by using Path testing

Sandeep Verma — Fri, 22 Nov 2019 19:02:40 +0000

In this type of testing, test cases are drived by considering all the independent paths of the DD graph.

In path testing, first we create the flow graph of the triangle problem based on the program which shows the flow and possible paths.

Once the flow graph is created, with the help of it list all the consecutive nodes and assign an alphabet to them.

After creating DD Table, it’s time to generate DD graph through which Cyclomatic complexity and the possible path will be gathered.

Using DD graph ( Decision to Decision graph ), calculate the cyclomatic complexity which tells all the independent paths.

Cyclomatic complexity = E – N + 2P

= 20-16+2

Possbile paths are:

-A,B,C,D,E,F,G,K,L,M,O,P
-A,B,C,D,E,F,H,I,K,L,M,O,P
-A,B,C,D,E,F,H,J,K,L,M,O,P
-A,B,C,D,K,L,M,O,P
-A,B,C,D,K,L,M,N,O,P
-A,B,K,L,M,O,P

Based on these paths, we will create Test cases.

Test ID	a	b	c	Expected Output	Program Output	Tested Outcome
1	5	10	5	Not a triangle	Invalid Input	Fail
2	10	9	5	Scalene triangle	Scalene triangle	Pass
3	5	1	5	Isosceles triangle	Isosceles triangle	Pass
4	5	5	5	Equilateral Triangle	Equilateral Triangle	Pass
5	-1	5	5	Invalid Input	Invalid Input	Pass
6	5	5	11	Invalid Input	Invalid Input	Pass

Design the test cases and test the program of Quadratic Equation problem using Path testing

Sandeep Verma — Fri, 22 Nov 2019 10:59:03 +0000

In this article, we will perform path testing on the quadratic equation program (Here’s the code) in order to generate test cases.

The first step is to create a flow graph using quadratic equation program.

After creating the flow graph, it’s time to make a Decision-to-Decision Graph (DD Graph). List one by one consecutive nodes and assign an alphabet.

Generate a DD graph.

Now, calculate cyclomatic complexity which represent the number of possible paths,

=E − N + 2P

=16-13+2

After calculating cyclomatic complexity, generate independent paths.

– A,B,D,F,H,I,J,L,M
– A,B,D,F,G,I,J,L,M
– A,B,D,E,I,J,L,M
– A,B,C,I,J,L,M
– A,B,C,I,J,K,L,M

The last step is to formulate test cases based on the calculated independent paths.

Test ID	a	b	c	Expected Output	Program Output	Tested Outcome
1	0	5	5	Not Quadratic	Not Quadratic	Pass
2	1	5	5	Real	Real	Pass
3	9	5	5	Imaginary	Imaginary	Pass
4	5	10	5	Equal	Equal	Pass
5	-1	5	5	Invalid Input	Invalid Input	Pass

path testing – Programmerbay

Design the test cases and test the program of Triangle problem by using Path testing

Design the test cases and test the program of Quadratic Equation problem using Path testing