I apologize, upon reviewing the document further, it does not contain a clear problem statement or question for me to summarize. The document seems to be discussing white box testing techniques such as basis path testing and cyclomatic complexity but does not provide a concise summary topic. Could you please provide more context on what aspect of the document you would like me to summarize?

1. Testing dan Implementasi Sistem Suwanto Raharjo Pertemuan ke 2:White Box Testing

4. White Box dan Black Box testing

7. Basis Path Testing Statement Decision Path coverage ? ? ?

8. Basis Path Testing

9. White Box Testing Independent Path pada gambar di atas: 1. 1-2-7-8 (property owned, pay rent) 2. 1-2-7-9 (property owned, no money for rent) 3. 1-2-3-4-5-6 (buy house) 4. 1-2-3 (don't want to buy) 5. 1-2-3-4 (want to buy, don't have enough money) Cyclomatic Complecity : Suatu ukuran untuk menghitung kekomplekan suatu kode sumber : CC = Jumlah edges – jumlah node + 2 atau Jumlah Kondisi + 1

10. White Box Testing

11. White Box Testing public static int binarySearch( int key, int[] sequence ) { int bottom = 0; int top = sequence.length - 1; int mid = 0; int keyPosition = -1; while( bottom <= top && keyPosition == -1 ) { mid = ( top + bottom ) / 2; if( sequence[ mid ] == key ) { keyPosition = mid; } else { if( sequence[ mid ] < key ) { bottom = mid + 1; } else { top = mid - 1; } } } return keyPosition; }

12. White Box Testing public static int binarySearch( int key, int[] sequence ) { int bottom = 0; int top = sequence.length - 1; int mid = 0; int keyPosition = -1; while( bottom <= top && keyPosition == -1 ) { mid = ( top + bottom ) / 2; if( sequence[ mid ] == key ) { keyPosition = mid; } else { if( sequence[ mid ] < key ) { bottom = mid + 1; } else { top = mid - 1; } } } return keyPosition; } 1 1

13. White Box Testing public static int binarySearch( int key, int[] sequence ) { int bottom = 0; int top = sequence.length - 1; int mid = 0; int keyPosition = -1; while( bottom <= top && keyPosition == -1 ) { mid = ( top + bottom ) / 2; if( sequence[ mid ] == key ) { keyPosition = mid; } else { if( sequence[ mid ] < key ) { bottom = mid + 1; } else { top = mid - 1; } } } return keyPosition; } 1 1 2 2

14. White Box Testing public static int binarySearch( int key, int[] sequence ) { int bottom = 0; int top = sequence.length - 1; int mid = 0; int keyPosition = -1; while( bottom <= top && keyPosition == -1 ) { mid = ( top + bottom ) / 2; if( sequence[ mid ] == key ) { keyPosition = mid; } else { if( sequence[ mid ] < key ) { bottom = mid + 1; } else { top = mid - 1; } } } return keyPosition; } 1 1 2 2 10 10 F F

15. White Box Testing 3 public static int binarySearch( int key, int[] sequence ) { int bottom = 0; int top = sequence.length - 1; int mid = 0; int keyPosition = -1; while( bottom <= top && keyPosition == -1 ) { mid = ( top + bottom ) / 2; if( sequence[ mid ] == key ) { keyPosition = mid; } else { if( sequence[ mid ] < key ) { bottom = mid + 1; } else { top = mid - 1; } } } return keyPosition; } 1 1 2 2 10 10 F F 3 T T F F

16. White Box Testing 3 public static int binarySearch( int key, int[] sequence ) { int bottom = 0; int top = sequence.length - 1; int mid = 0; int keyPosition = -1; while( bottom <= top && keyPosition == -1 ) { mid = ( top + bottom ) / 2; if( sequence[ mid ] == key ) { keyPosition = mid; } else { if( sequence[ mid ] < key ) { bottom = mid + 1; } else { top = mid - 1; } } } return keyPosition; } 1 1 2 2 10 10 F F 3 T T F F 4 T 4 T 5 T 5 T

17. White Box Testing 3 public static int binarySearch( int key, int[] sequence ) { int bottom = 0; int top = sequence.length - 1; int mid = 0; int keyPosition = -1; while( bottom <= top && keyPosition == -1 ) { mid = ( top + bottom ) / 2; if( sequence[ mid ] == key ) { keyPosition = mid; } else { if( sequence[ mid ] < key ) { bottom = mid + 1; } else { top = mid - 1; } } } return keyPosition; } 1 1 2 2 10 10 F F 3 T T F F 4 T 4 T 5 T 5 T 6 F 6 F

18. White Box Testing 3 public static int binarySearch( int key, int[] sequence ) { int bottom = 0; int top = sequence.length - 1; int mid = 0; int keyPosition = -1; while( bottom <= top && keyPosition == -1 ) { mid = ( top + bottom ) / 2; if( sequence[ mid ] == key ) { keyPosition = mid; } else { if( sequence[ mid ] < key ) { bottom = mid + 1; } else { top = mid - 1; } } } return keyPosition; } 1 1 2 2 10 10 F F 3 T T F F 4 T 4 T 5 T 5 T 6 F 6 F 9 9

19. White Box Testing 3 public static int binarySearch( int key, int[] sequence ) { int bottom = 0; int top = sequence.length - 1; int mid = 0; int keyPosition = -1; while( bottom <= top && keyPosition == -1 ) { mid = ( top + bottom ) / 2; if( sequence[ mid ] == key ) { keyPosition = mid; } else { if( sequence[ mid ] < key ) { bottom = mid + 1; } else { top = mid - 1; } } } return keyPosition; } 1 1 2 2 10 10 F F 3 T T F F 4 T 4 T 5 T 5 T 6 F 6 F 7 T 9 7 T 9

20. White Box Testing 3 public static int binarySearch( int key, int[] sequence ) { int bottom = 0; int top = sequence.length - 1; int mid = 0; int keyPosition = -1; while( bottom <= top && keyPosition == -1 ) { mid = ( top + bottom ) / 2; if( sequence[ mid ] == key ) { keyPosition = mid; } else { if( sequence[ mid ] < key ) { bottom = mid + 1; } else { top = mid - 1; } } } return keyPosition; } 1 1 2 2 10 10 F F 3 T T F F 4 T 4 T 5 T 5 T 6 F 6 F 7 T 8 F 9 7 T 8 F 9

21. White Box Testing 3 public static int binarySearch( int key, int[] sequence ) { int bottom = 0; int top = sequence.length - 1; int mid = 0; int keyPosition = -1; while( bottom <= top && keyPosition == -1 ) { mid = ( top + bottom ) / 2; if( sequence[ mid ] == key ) { keyPosition = mid; } else { if( sequence[ mid ] < key ) { bottom = mid + 1; } else { top = mid - 1; } } } return keyPosition; } 1 1 2 2 10 10 F F 3 T T F F 4 T 4 T 5 T 5 T 6 F 6 F 7 T 8 F 9 7 T 8 F 9

22. White Box Testing 3 public static int binarySearch( int key, int[] sequence ) { int bottom = 0; int top = sequence.length - 1; int mid = 0; int keyPosition = -1; while( bottom <= top && keyPosition == -1 ) { mid = ( top + bottom ) / 2; if( sequence[ mid ] == key ) { keyPosition = mid; } else { if( sequence[ mid ] < key ) { bottom = mid + 1; } else { top = mid - 1; } } } return keyPosition; } 1 1 2 2 10 10 F F 3 T T F F 4 T 4 T 5 T 5 T 6 F 6 F 7 T 8 F 9 7 T 8 F 9

23. White Box Testing 3 public static int binarySearch( int key, int[] sequence ) { int bottom = 0; int top = sequence.length - 1; int mid = 0; int keyPosition = -1; while( bottom <= top && keyPosition == -1 ) { mid = ( top + bottom ) / 2; if( sequence[ mid ] == key ) { keyPosition = mid; } else { if( sequence[ mid ] < key ) { bottom = mid + 1; } else { top = mid - 1; } } } return keyPosition; } 1 1 2 2 10 10 F F 3 T T F F 4 T 4 T 5 T 5 T 6 F 6 F 7 T 8 F 9 7 T 8 F 9