软件测试homework3

Posted hzj3015218059

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了软件测试homework3相关的知识,希望对你有一定的参考价值。

/**
* 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.


(a) Draw the control flow graph for the printPrime() method.
(b) Consider test cases ti = (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.
(c) 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.
(d) Enumerate the test requirements for node coverage, edge coverage,and prime path coverage for the path for printPrimes().

a)Draw the control flow graph for the printPrime() method.

技术分享图片

 

(b) Consider test cases ti = (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数组越界,t1不会有错误

(c)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

(d) Enumerate the test requirements for node coverage, edge coverage,and prime path coverage for the path for printPrimes().

node coverage : TR  =  {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16}

 edge coverage :TR =  { (1,2), (2,3), (2,12), (3,4), ( 4,5 ), (5,6), (5,9), (6,7), (6,8), (7,9), (8,5), (9,10), (9,11), (10,11), (11,2),(12,13), (13,14) , (14,15),(14,16), (15,14)}

 prime path coverage : 

(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,14,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)

(2,3,4,5,6,8)

(3,4,5,6,7,9,10,11,2,3)

(3,4,5,6,7,9,11,2,3)

(3,4,5,6,8)

(3,4,5,6,7,9,10,11,2,12,13,14,15)

(3,4,5,6,7,9,10,11,2,12,13,14,16)

(5,6,8,5)

(14,15,14)

 









































以上是关于软件测试homework3的主要内容,如果未能解决你的问题,请参考以下文章

软件测试homework3

软件测试homework3

软件测试homework3的主路径覆盖

软件工程 Homework3

软件测试 homework3 控制流图和主路径覆盖

Homework3