1. /** ***************************************************** 2. * Finds and prints n prime integers 3. * Jeff Offutt, Spring 2003 4. ********************************************************* */ 5. private static void printPrimes (int n) 6. {

7. int curPrime; // Value currently considered for primeness 8. int numPrimes; // Number of primes found so far. 9. boolean isPrime; // Is curPrime prime? 10. int [] primes = new int [MAXPRIMES]; // The list of prime numbers. 11. 12. // Initialize 2 into the list of primes. 13. primes [0] = 2; 14. numPrimes = 1; 15. curPrime = 2; 16. while (numPrimes < n) 17. { 18. curPrime++; // next number to consider ... 19. isPrime = true; 20. for (int i = 0; i <= numPrimes-1; i++) 21. { // for each previous prime. 22. if (isDivisible (primes[i], curPrime)) 23. { // Found a divisor, curPrime is not prime. 24. isPrime = false; 25. break; // out of loop through primes. 26. } 27. } 28. if (isPrime) 29. { // save it! 30. primes[numPrimes] = curPrime; 31. numPrimes++; 32. } 33. } // End while 34. 35. // Print all the primes out. 36. for (int i = 0; i <= numPrimes-1; i++) 37. { 38. System.out.println ("Prime: " + primes[i]); 39. } 40. } // end printPrimes

1) Draw a CFG. 2) Identify all paths 3) How to achieve node coverage? 4) How to achieve edge coverage?

5) Consider test cases t1 = (n = 3) and t2 = (n = 5). Although these tour the same prime paths in printPrimes(), they do not necessarily find the same faults. Design a simple fault that t2 would be more likely to discover thant1 would. 6) For printPrimes(), find a test case such that the corresponding testpath visits the edge that connects the beginning of the while state- ment to the for statement without going through the body of the while loop. 7) List test paths that achieve node coverage but not edge coverage on the graph.