Software Testing 4

Use the following method Printprimes () for questions a–d.

The title code is as follows:

/******************************************************* * Finds and prints n prime integers * Jeff Offutt, Sp Ring 2003 ******************************************************/      Public Static voidPrintprimes (intN) {intCurprime;//Value currently considered for primeness        intNumprimes;//Number of primes found so far.Boolean isprime;//Is curprime prime?        int[] primes =New int[Maxprimes];//The list of prime numbers. //Initialize 2 into the list of primes.primes [0] =2; Numprimes=1; Curprime=2;  while(Numprimes <N) {curprime++;//next number to consider ...IsPrime =true;  for(inti =0; I <= numprimes-1; i++)             { //For each previous prime.                if(Isdivisable (primes[i],curprime)) {//Found a divisor, curprime is not prime.IsPrime =false;  Break;//Out of loop through primes.                }             }             if(isprime) {//Save It!Primes[numprimes] =Curprime; Numprimes++; }         } //End while//Print all the primes out.         for(inti =0; I <= numprimes-1; i++) {System. out. println ("Prime:"+Primes[i]); }     } //End Printprimes

A. Control flow graph

B. Make maxprimes=4, so T2 will test out the cross-boundary error, T1 not.

C. Input N=1

D.

1. Node Overwrite {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16}

2. Side overlay {(2,3), (3,4), (4,5), (5,6), (6,7), (5,9), (6,8), (8,5), (7,9), (9,10), (10,11), (9,11), (11,2), (2,12), (12,13), (13,14), (14,15), (15,12), (13,16)}

3. Basic path overrides {(1,2,3,4,5,6,7,9,10,11), (1,2,3,4,5,6,7,9,11), (1,2,3,4,5,6,8), (1,2,3,4,5,9,10,11), (1,2,3,4,5,9,11), (1, 2,12,13,14,15), (1,2,12,13,16), (2,3,4,5,6,7,9,10,11,2), (2,3,4,5,6,7,9,11,2), (2,3,4,5,9,10,11,2), (2,3,4,5,9, 11,2), (3,4,5,6,7,9,10,11,2,3), (3,4,5,6,7,9,11,2,3), (3,4,5,9,10,11,2,3), (3,4,5,9,11,2,3), (3,4,5,6,7,9,10,11,2, 12,13,14,15), (3,4,5,6,7,9,10,11,2,12,13,16), (3,4,5,6,7,9,11,12,2,12,13,14,15), (3,4,5,6,7,9,11,12,2,13,16), (3, 4,5,9,10,11,2,12,13,14,15), (3,4,5,9,10,11,2,12,13,16), (3,4,5,9,11,2,12,13,14,15), (3,4,5,9,11,2,12,13,16), (4, 5,6,7,9,10,11,2,3,4), (4,5,6,7,9,11,2,3,4), (4,5,9,10,11,2,3,4), (4,5,9,11,2,3,4), (5,6,7,9,10,11,2,3,4,5), ( 5,6,7,9,11,2,3,4,5), (5,9,10,11,2,3,4), (5,9,11,2,3,4,5), (5,6,8,5), (6,7,9,10,11,2,3,4,5,6), (6,7,9,11,2,3,4,5,6), (6,8,5,9,10,11,2,3,4,5,6), (6,8,5,9,11,2,3,4,5,6), (6,8,5,9,10,11,2,12,13,14,15), (6,8,5,9,10,11,2,12,13,16), ( 6,8,5,9,11,2,12,13,14,15), (6,8,5,9,11,2,12,,13,16), (7,9,10,11,2,3,4,5,6,7), (7,9,11,2,3,4,5,6,7), ( 7,9,10,11,2,3,4,5,6,8), (7,9,11,2,3,4,5,8), (8,5,6,8), (8,5,6,7,9,10,11,2,3,4), (8,5,6,7,9,11,2,3,4), (8,5,6,7,9,10,11,2,12,13,14,15), ( 8,5,6,7,9,10,11,2,12,13,16), (8,5,6,7,9,11,2,12,13,14,15), (8,5,6,7,9,11,2,12,13,16), (9,10,11,2,3,4,5,9), ( 9,11,2,3,4,5,9), (9,10,11,2,3,4,5,6,7,9), (9,11,2,3,4,5,6,7,9), (10,11,2,3,4,5,6,7,9,10), (10,11,2,3,4,5,9,10), ( 11,2,3,4,5,6,7,9,10,11), (11,2,3,4,5,6,7,9,11), (11,2,3,4,5,9,10,11), (11,2,3,4,5,9,11), (13,14,15,13), ( 14,15,13,14), (14,15,13,16), (15,13,14,15)}

Software Test 4