Basis Path Testing & Unit Testing Course: SWE-222 (SWE Quality Assurance & Testing) Department of Software Engineering Daffodil International University, Dhaka, Bangladesh

1. Basis Path Testing &
Unit Testing
SHEKH RASEL MASRUR AHMMAD (161-35-1423)
RAIHAN MAHMUD (161-35-1542)
PRASHANTA SARKER (161-35-1539)
ZAKARIA KHAN (161-35-1532)

2. Program-1
Step-2
Cyclomatic complexity(C.C):
i) Number of Regions = 5.
ii) Pridicate Node + 1 = 4+1 = 5.
iii) Edge – Node + 2 = 21-18+2 = 3+2 = 5.
Step-1

3. Step-4
Test case:
Step-3
Independent path:
Path – 1: 1 – 2 – 18
Path – 2: 1 – 2 – 3 – 18
Path – 3: 1 – 2 – 3 – 4 – 18
Path – 4: 1 – 2 – 3 – 4 – 5 – 6 – 10 – 11 – 12
Path – 5: 1 – 2 – 3 – 4 – 5 – 7 – 8 – 10 – 11 – 13 – 14
Path – 6: 1 – 2 – 3 – 4 – 5 – 7 – 9 – 10 – 11 – 13 – 15 – 16
Path – 7: 1 – 2 – 3 – 4 – 5 – 7 – 9 – 10 – 11 – 13 – 15 – 17
Path Input Expected Result
1 5 , 4 , 31 Sorry, Try Again!
2 5 , 15 , 2 Sorry, Try Again!
3 5 , 2 , 1 Sorry, Try Again!
4 8 , 8 , 8 It is Equilateral Triangle! Reason:
It’s all sides are equal!
5 9 , 9 , 8 It is Isosceles Triangle! Reason:
It’s two sides are equal!
6 2 , 3 , 4 It is Scalene Triangle! Reason: It’s
all sides have different length!
7 No input available

4. Unit testing:

5. Program-2
Step-1 Step-2
Cyclomatic complexity(C.C):
i) Number of Regions = 2.
ii) Pridicate Node + 1 = 1+1 = 2.
iii) Edge – Node + 2 = 4-4+2 = 2.

6. Step-3
Independent path:
Path-1: 1-2-4
Path-2: 1-2-3-4
Step-4
Test case:
Path Input Expected Result
1 array.Length = 0 0
2 array.Length = 2;
array[i] = 1, 2
3

7. Step-1
Step-2
Cyclomatic complexity(C.C):
i) Number of Regions = 3.
ii) Pridicate Node + 1 = 2+1 = 3.
iii) Edge – Node + 2 = 6-5+2 = 3.
Step-3
Independent path:
Path-1: 1-2-5
Path-2: 1-2-3-2-5
Path-3: 1-2-3-4-2-5

8. Step-4
Test case:
Path Input Expected Result
1 array.Length = 0 0
2 array.Length = 1;
array [i] = 0
0
3 array.Length = 2;
array [i] = 2,5
5
Unit testing:

9. Program-3
Step-1

10. Step-2
Cyclomatic complexity(C.C):
i) Number of Regions = 5.
ii) Pridicate Node + 1 = 4+1 = 5.
iii) Edge – Node + 2 = 13-10+2 = 3+2 = 5.
Step-3
Independent path:
Path-1: 1-2-4-10
Path-2: 1-2-4-5-10
Path-3: 1-2-3-2-4-5-6-7-9-4-10
Path-4: 1-2-3-2-4-5-6-8-9-4-10
Step-4
Test case:
Path Input Expected Result
1 array.Length = 0 No output
2 No input available
3 array.Length = 2;
array[j] = 2, 4
even, even
sum = 6
ave = 2
4 array.Length = 2;
array[j] = 3, 1
odd, odd
sum = 0

11. Unit testing:
1st Step:
File >> Add >> New project >> select - Unit Test Project

12. 2nd Step:
Solution Explorer >> select – Unit Test >> click right button >> Add >> Reference
Browse your test project file then >> bin >> Debug >> select 2 item then click “Add” button >> OK

13. 3rd Step:
In UnitTest project declar “unsing” + your project namespace then create your program class object in Unit test class and
declar your method in “Test method” then
Test >> Run >> All Tests.

14. Program-4
Step-1
Step-2
Cyclomatic complexity(C.C):
i) Number of Regions = 2.
ii) Pridicate Node + 1 = 1+1 = 2.
iii) Edge – Node + 2 = 4-4+2 = 2.
Step-3
Independent path:
Path-1: 1-2-4
Path-2: 1-2-3-2-4
Step-4
Test case:
Path Input Expected Result
1 No input available
2 5 120

15. Unit testing:

16. Program-5
Step-1 Step-2
Cyclomatic complexity(C.C):
i) Number of Regions = 3.
ii) Pridicate Node + 1 = 2+1 = 3.
iii) Edge – Node + 2 = 7-6+2 = 3.
Step-3
Independent path:
Path-1: 1-2-4-6
Path-2: 1-2-3-2-4-6
Path-3: 1-2-3-2-4-5-6
Step-4
Test case:
Path Input Expected Result
1 a1.Lehgth = 0;
a2.Lehgth = 0
0
2 a1.Lehgth = 2;
a1.[x] = 2, 1
a2.Lehgth = 0;
3
3 a1.Lehgth = 2;
a1.[x] = 2, 1
a2.Lehgth = 2;
a2.[x] = 4, 5
12

17. Unit testing: