L-2 WHITE-BOX TESTING PADA PROGRAM PASCAL PDF

Preview

Summary

1 WHITE-BOX TESTING PADA PROGRAM PASCAL Lutfhi Nauval (1), Dwian Luisana Parolinda(2), Ali Miftahul Ramdan(3), Anwar Aziz Anshori(4) Universitas Siliwangi Jl.Siliwangi No.24 Kahuripan, Tawang, Tasikmalaya, Jawa Barat 46115 e-mail: [email protected]), [email protected]), 167...

Description

Accelerat ing t he world's research.

L-2 WHITE-BOX TESTING PADA PROGRAM PASCAL Dwian Luisana Dwian Luisana

Related papers Pet unjuk Prakt ikum (Edisi Revisi Muhammad Hafizh Sangaji

Pet unjuk Prakt ikum Pemrograman Komput er Put ri Ayu

Download a PDF Pack of t he best relat ed papers 

1

WHITE-BOX TESTING PADA PROGRAM PASCAL Lutfhi Nauval (1), Dwian Luisana Parolinda(2), Ali Miftahul Ramdan(3), Anwar Aziz Anshori(4) Universitas Siliwangi Jl.Siliwangi No.24 Kahuripan, Tawang, Tasikmalaya, Jawa Barat 46115 e-mail: [email protected]), [email protected]), [email protected]), [email protected])

Abstrak Pengujian dilakukan untuk menjamin kualitas dan juga mengetahui kelemahan dari perangkat lunak. Tujuan dari pengujian ini adalah untuk menjamin bahwa perangkat lunak yang dibangun memiliki kualitas yang handal, yaitu mampu mempresentasikan kajian pokok dari spesifikasi, analisis, perancangan dan pengkodean dari perangkat lunak itu sendiri. Tujuan lain dari pengujian white box yaitu untuk menguji dari sisi Kode Program, Flow Graph, Cyclomatic Complexity, Independet Path, dan Graph Matrix. Kata kunci: white box testing, kode program, flow graph, cyclomatic complexity, independent path, graph matrix.

1. Pendahuluan White Box testing adalah pengujian yang didasarkan pada pengecekan terhadap detail perancangan, menggunakan struktur control dari desain program secara procedural untuk membagi pengujian ke dalam beberapa kasus pengujian. Flow graph merupakan grafik yang digunakan untuk menggambarkan aliran control dari sebuah program. Cyclomatic Complexity adalah software metric yang menyediakan ukuran kuantitif dari kompleksitas logika dari sebuah program. Independent path adalah setiap path yang dilalui program yang menunjukkan satu set baru dari pemrosesan statement atau dari sebuah kondisi baru. 2. Metode Penelitian Metode yang dilakukan adalah metode studi pustaka yaitu dengan pengumpulan data dengan mencari informasi lewat buku ataupun ebook 3. Hasil dan Pembahasan 3.1 Pengujian TES1.PAS a. Kode Program 1. 2. 3. 4. 5.

Program Coba; Var a , b : integer; Begin a := 5; {1} b := 10; {2} writeln; {3} end.

b. Flow Graph

c. Cyclomatic Complexity Cara 1 E=0 N=1 V(G) = E – N + 2 = 0–1+2 = 1

 L-2

Cara 2 Number of Region V(G) = 1

Cara 3 P =0 V(G) = P + 1 =0+1 =1



2 d. Independent Path Cara-4 Path 1 = 1,2,3,4,5 V(G) = 1 e. Graph Matrix menggunakan Connection Matrix dan Cara-5 1,2,3,4,5 Total 1,2,3,4,5 1 1–1=0 Total = 0 V(G) = Total + 1 = 0 + 1 =1 3.2 Pengujian TES2.PAS a. Kode Program 1. 2. 3. 4. 5. 6. 7. 8.

Program Var a , Begin a := b := if a a := else b := end.

Coba; b : integer; 5; {1} 8; > b then {2} 2 {3} a;

b. Flow Graph

c. Cyclomatic Complexity Cara 1 Cara 2 Cara 3 E=4 Number of Region P =1 N=4 V(G) = 2 V(G) = P + 1 V(G) = E – N + 2 =1+1 = 4–4+2 =2 = 2 d. Independent Path Cara-4 Path 1 = 1,2,3,4,5,6,8 Path 2 = 1,2,3,7,8 V(G) = 2 e. Graph Matrix menggunakan Connection Matrix dan Cara-5 1,2,3,4 5,6 7 8 1,2,3,4 1 1 5,6 1 7 1 8

Total 2–1=1 1–1=0 1–1=0 Total = 1

V(G) = Total + 1 = 1 + 1 =2

 3 3.3 Pengujian TES3.PAS a. Kode Program 1. 2. 3. 4. 5. 6.

Program Coba; Var a , b : integer; Begin A := 5; {1} If a > 3 then {2} a := 2; writeln(a); end.

b. Flow Graph

c. Cyclomatic Complexity Cara 1 Cara 2 Cara 3 E=3 Number of Region P =1 N=3 V(G) = 2 V(G) = P + 1 =1+1 V(G) = E – N + 2 =2 = 3–3+2 = 2 d. Independent Path Cara-4 Path 1 = 1,2,3,5,6 Path 2 = 1,2,3,4,5,6 V(G) = 2 e. Graph Matrix menggunakan Connection Matrix dan Cara-5 1,2,3 4 5,6 Total 1,2,3 1 1 2–1=1 4 1 1–1=0 5,6 Total = 1 V(G) = Total + 1 = 1 + 1 =2 3.4 Pengujian TES4.PAS a. Kode Program 1. 2. 3. 4. 5. 6. 7. 8. 9.

Program Coba; var a : integer; begin a := 5; while a < 10 do begin a := a + 1; end; a := a + 10; writeln; end.



4 b. Flow Graph

c. Cyclomatic Complexity Cara 1 Cara 2 Cara 3 E=5 Number of Region P =1 N=5 V(G) = 2 V(G) = P + 1 V(G) = E – N + 2 =1+1 =2 = 5–5+2 = 2 d. Independent Path Cara-4 Path 1 = 1,2,3,4,5,6,3,7,8,9 Path 2 = 1,2,3,7,8,9 V(G) = 2 e. Graph Matrix menggunakan Connection Matrix dan Cara-5 1,2 3 4,5,6 7 8,9 1,2 1 3 1 1 4,5,6 1 7 1 8,9

Total 1–1=0 2–1=1 1–1=0 1–1=0 Total = 1

V(G) = Total + 1 = 1 + 1 =2

3.5 Pengujian TES5.PAS a. Kode Program 1. 2. 3. 4. 5. 6. 7.

Program Coba; Var a : integer; Begin for a := 5 to 10 do begin writeln(a); end; writeln; end.

 5 b. Flow Graph

c. Cyclomatic Complexity Cara 1 Cara 2 Cara 3 E=3 Number of Region P =1 N=3 V(G) = 2 V(G) = P + 1 V(G) = E – N + 2 =1+1 = 3–3+2 =2 = 2 d. Independent Path Cara-4 Path 1 = 1,2,3,4,5,6,7 Path 2 = 1,2,3,4,5,1,2,3,4,5,6,7 V(G) = 2 e. Graph Matrix menggunakan Connection Matrix dan Cara-5 1,2 3,4,5 6,7 Total 1,2 1 1–1=0 3,4,5 1 1 2–1=1 6,7 Total = 1 V(G) = Total + 1 = 1 + 1 =2

3.6 Pengujian TES6.PAS a. Kode Program 1. 2. 3. 4. 5. 6. 7. 8.

Program Coba; Var a : integer; Begin a := 5; repeat a := a + 1; until a > 10; a := a + 20; writeln; end.



6 b. Flow Graph

c. Cyclomatic Complexity Cara 1 Cara 2 Cara 3 E=5 Number of Region P =1 N=5 V(G) = 2 V(G) = P + 1 V(G) = E – N + 2 =1+1 = 5–5+2 =2 = 2 d. Independent Path Cara-4 Path 1 = 1,2,3,4,5,6,7,8 Path 2 = 1,2,3,4,5,3,4,5,6,7,8 V(G) = 2 e. Graph Matrix menggunakan Connection Matrix dan Cara-5 1,2 3 4 5 6,7,8 1,2 1 3 1 4 1 5 1 1 6,7,8 V(G) = Total + 1 = 1 + 1 =2 3.7 Pengujian TES7.PAS a. Kode Program 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11.

Program Coba; var a : integer; begin a := 5; while a < 10 do begin if a > 5 then writeln(a); a := a + 1; end; a := a + 10; writeln; end.

Total 1–1=0 1–1=0 1–1=0 2–1=1 Total = 1

 7 b. Flow Graph

c. Cyclomatic Complexity Cara 1 Cara 2 Cara 3 E=8 Number of Region P =2 N=7 V(G) = 3 V(G) = P + 1 V(G) = E – N + 2 =2+1 =8 –7+2 =3 = 3 d. Independent Path Cara-4 Path 1 = 1,2,3,11 Path 2 = 1,2,3,4,5,6,7,8,9,10,3,11 Path 3 = 1,2,3,4,5,7,8,9,10,3,11 V(G) = 3 e. Graph Matrix menggunakan Connection Matrix dan Cara-5 1,2 3 4,5 6 7,8 9,10 11 1,2 1 3 1 1 4,5 1 1 6 1 7,8 1 9,10 1 11

Total 1–1=0 2–1=1 2–1=1 1–1=0 1–1=0 1–1=0 Total = 2

V(G) = Total + 1 = 2 + 1 =2

3.8 Pengujian TES8.PAS a. Kode Program 1. 2. 3. 4. 5. 6. 7. 8. 9. 10.

Program Coba; Var a, b : integer; Begin Readln (a, b); Case a of 1 : if a > b then writeln(a); 2 : if a < b then writeln(b); end; writeln(a, b); end.



8 b. Flow Graph

c. Cyclomatic Complexity Cara 1 Cara 2 Cara 3 E=6 Number of Region P =1 N=6 V(G) = 2 V(G) = P + 1 V(G) = E – N + 2 =1+1 =6 –6+2 =2 = 2 d. Independent Path Cara-4 Path 1 = 1,2,3,4,5,8,9,10 Path 2 = 1,2,3,6,7,8,9,10 V(G) = 2 e. Graph Matrix menggunakan Connection Matrix dan Cara-5 1,2 3 4,5 6,7 8 9,10 Total 1,2 1 1-1=0 3 1 1 2-1=1 4,5 1 1-1=0 6,7 1 1-1=0 8 1 1-1=0 9,10 Total=1 V(G) = 1+1=2 3.9 Pengujian TES9.PAS a. Kode Program 1. 2. 3. 4. 5. 6. 7. 8. 9.

Program Coba; var a, b : integer; begin readln (b); for a := 1 to 10 do begin if a > b then writeln(a) else writeln(b); end; writeln(a, b); end.

 9 b. Flow Graph

c. Cyclomatic Complexity Cara 1 Cara 2 Cara 3 E=8 Number of Region P =2 N=7 V(G) = 3 V(G) = P + 1 V(G) = E – N + 2 =2+1 = 8–7+2 =3 = 3 d. Independent Path Cara-4 Path 1 = 1,2,3,4,5a,5b,7,3,8,9 Path 2 = 1,2,3,4,5a,6,7,3,8,9 Path 3 = 1,2,3,8,9 V(G) = 3 e. Graph Matrix menggunakan Connection Matrix dan Cara-5 1,2,3 4,5 6 7 8 9 10 Total 1,2,3 1 1–1=0 4,5 1 1 2–1=1 6 1 1–1=0 7 1 1–1=0 8 1 1–1=0 9 1 1 2–1=1 10 Total = 2 V(G) = Total + 1 = 2 + 1 =3

3.10 Pengujian TES10.PAS a. Kode Program 1. 2. 3. 4. 5. 6. 7. 8. 9.

Program Coba; Var a, b : integer; Begin Readln (a); Repeat if a > 3 then writeln(a); a := a + 1; until a > 5; writeln(a); end.



10 b. Flow Graph

c. Cyclomatic Complexity Cara 1 Cara 2 Cara 3 E=6 Number of Region P =1 N=6 V(G) = 2 V(G) = P + 1 V(G) = E – N + 2 =1+1 =6 –6+2 =2 = 2 d. Independent Path Cara-4 Path 1 = 1,2,3,4,5,6,7,8.9 Path 2 = 1,2,3,4,5,6,7,3,4,5,6,7,8,9 V(G) = 2 e. Graph Matrix menggunakan Connection Matrix dan Cara-5 1,2 3 4,5 6 7 8,9 1,2 1 3 1 4,5 1 6 1 7 1 1 8,9 V(G) = Total + 1 = 1 + 1 =2 3.11 Pengujian TES11.PAS a. Kode Program

1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15.

Program BinomialCoefficients; Var i, a, b : integer; m, n : integer; begin readln( m, n ); a := 1; if 2 * m > n then b := n - m else b := m; i := 0; while i 0 then begin theta := 0.0; phi := arctan(y/x)+theta; r := sqrt( x*x+y*y ); r := exp( w * ln(r)); a := r * cos( w * phi); b := r * sin( w * phi); end; if (x < 0) and (y >= 0) then

Total 1-1=0 2-1=1 1-1=0 1-1=0 1-1=0 2-1=1 1-1=0 1-1=0 Total=2



12 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. 28. 29. 30. 31. 32. 33. 34. 35. 36. 37. 38. 39. 40. 41. 42. 43. 44. 45. 46. 47. 48. 49. 50. 51. 52.

begin theta := 3.1; phi := arctan(y/x)+theta; r := sqrt( x*x+y*y ); r := exp( w * ln(r)); a := r * cos( w * phi); b := r * sin( w * phi); end; if (x...