[JAVA] Testing & QA

Write a (set of) test path(s) that achieve Edge Coverage but not Prime Path Coverage on the graph. For each of them, identify the input(s) that will allow its execution.

----------------------------------------------------------------

public int[] printPrimes (int n, boolean showAll) { int curPrime; // Value currently considered for primeness int numPrimes; // Number of primes found so far. boolean isPrime; // Is curPrime prime? int [] primes = new int [100]; // The list of prime number candidates. // Initialize 2 into the list of primes. primes [0] = 2; numPrimes = 1; curPrime = 2; while (numPrimes  
Control Flow Graph
 
  START 1. intl primes = new int [100]; 2. primes [0] = 2; 3. numPrimes = 1; 4. curPrimes = 2: 5. while (num Primes <>