软件测试作业3

程序如下:

public 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[100]; // 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 (int i = 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 (int i = 0; i <= numPrimes - 1; i++) {
        System.out.println("Prime: " + primes[i]);
    }
} // end printPrimes

(a)

绘制控制流图:

(b)

将while循环中的条件改为numPrimes < 3,如果n = 3,程序不会发现错误;但当n = 5时,程序会很快发现错误。

(c)

令n = 1即可。

(d)

节点覆盖:

TR = {1,2,3,4,5,6,7,8,9,10,11,12,13};

边覆盖:

TR = {(1,2),(2,3),(2,10),(3,4),(4,5),(4,8),(5,6),(5,7),(6,8),(7,4),(8,2),(8,9),(9,1),(2,10),(10,11),(11,12),(12,11),(12,13)};

主路径覆盖:

TR = {(3,4,5,6,8,9,2,10,11,12),(3,4,5,6,8,9,2,10,11,13),(7,4,5,6,8,9,2,10,11,12),(7,4,5,6,8,9,2,10,11,13)};

主路径覆盖测试代码:

package st_homework2;

import static org.junit.Assert.*;

import java.io.ByteArrayOutputStream;
import java.io.PrintStream;

import org.junit.Before;
import org.junit.Test;

public class PrimeTest {
    Prime prime;
    ByteArrayOutputStream baos;
    
    @Before
    public void setUp() throws Exception {
        prime = new Prime();
        baos = new ByteArrayOutputStream();
        System.setOut(new PrintStream(baos));
    }

    @Test
    public void testPrintPrimes() {
        String outcome = new String("Prime: 2\r\nPrime: 3\r\nPrime: 5\r\nPrime: 7\r\nPrime: 11\r\nPrime: 13\r\nPrime: 17\r\nPrime: 19\r\n");
        prime.printPrimes(8);
        assertEquals(outcome, baos.toString()); 
    }

}

程序将输出的控制台的数据流重定向到另外的新的打印流,也就是我们提前设置的字节输出流内,然后将它与我们设想的输出字符串比较。结果如下:

转载于:https://www.cnblogs.com/C6H5CH3/p/8654894.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值