1.源代码:
/**
* Finds and prints n prime integers
* Jeff Offutt, Spring 2003
*/
private static void printPrimes(int n) {
int curPrime; //Value currently considered for primeness
int numPrimes; // Number of primes found so far;
boolean isPrime; //Is curPrime prime?
int[] primes = new int[MAXPRIMES];// The list of primes.
// 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(int i = 0; i <= numPrimes; i++ ) {
//for each previous prime.
if(isDvisible(primes[i],curPrime)) {
//Found a divisor, curPrime is not prime.
isPrime = false;
break;
}
}
if(isPrime) {
// save it!
primes[numPrimes] = curPrime;
numPrimes++;
}
}// End while
// print all the primes out
for(int i = 0; i < numPrimes; i++) {
System.out.println("Prime: " + primes[i] );
}
}// End printPrimes.
2.Draw the control flow graph for the printPrime() method:
3.Consider test cases t1 = (n = 3) and t2 = ( n = 5). Although these tour the same prime paths in printPrime(), they don‘t necessarily find the same faults. Design a simple fault that t2 would be more likely to discover than t1 would.
数组越界错误 比如 MAXPRIMES = 4 的情况下t2就有可能出现这样的错误。
4.For printPrime(), find a test case such that the corresponding test path visits the edge that connects the beginning of the while statement to the for statement without going through the body of the while loop.
在n=1的时候就不会进入循环
5. Enumerate the test requirements for node coverage, edge coverage,and prime path coverage for the path for printPrimes().
点覆盖:{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15}
边覆盖:{(1,2),(2,3),(3,4),(3,12),(4,5),(5,6),(6,9),(6,7),(7,8),(7,10),(8,9),(9,11),(9,3),(10,6),(11,3),(12,13),(13,14),(14,15),(15,13),(13,16)}
主路径覆盖:{(1,2,3,4,5,6,7,8,9,11),(1,2,3,4,5,6,7,10),(1,2,3,12,13,16),(1,2,3,12,13,14,15),(3,4,5,6,7,8,9,11,3),(4,5,6,7,8,9,11,3,4),(5,6,7,8,9,11,3,4,5),(6,7,10,6),(6,7,8,9,11,3,4,5,6),(7,10,6,7),(7,8,9,11,3,4,5,6,7),(8,9,11,3,4,5,6,7,8),(9,11,3,4,5,6,7,8,9),(10,6,7,10),(11,3,4,5,6,7,8,9,11),(13,14,15,13),(14,15,13,14),(15,13,14,15),(14,15,13,16),(15,13,16)}
6. List test paths that achieve node coverage but not edge coverage ont the graph.
{1,2,3,4,5,6,7,5,8,9,10,11,2,12,13,14,15,13,16}
7. List test paths that achieve edge coverage but not prime path coverage on the graph.
{ [1,2,3,4,5,6,7,5,8,9,10,11,2,13,14,15,13,16], [1,2,3,4,5,9,10,11,2,12,13,16] }
8.测试代码:
import static org.junit.Assert.*;
import java.io.ByteArrayInputStream;
import java.io.ByteArrayOutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PipedInputStream;
import java.io.PipedOutputStream;
import java.io.PrintStream;
import java.util.Scanner;
import org.hamcrest.core.AllOf;
import org.junit.Before;
import org.junit.Test;
public class TestHomework3 {
ByteArrayOutputStream out;
PrintStream ps;
public Homework3 primes = new Homework3();
int [] print = {2, 3, 5};
@Before
public void setUp(){
out = new ByteArrayOutputStream();
ps = new PrintStream(out);
System.setOut(ps);
}
@Test
public void test() throws IOException {
out.flush();
primes.printPrimes(3);
assertEquals("Prime: 2\r\nPrime: 3\r\nPrime: 5\r\n", out.toString());
}
}
9.测试结果:
原文地址:https://www.cnblogs.com/zyd746714868/p/8654429.html