软件测试:3.Exercise Section 2.3

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

  Questions:

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

  (b) Consider test cases t1 = (n = 3) and t2 = ( n = 5). Although these tour the same prime paths in printPrime(), they do not necessarily find the same faults. Design a simple fault that t2 would be more likely to discover than t1 would.

  (c) For printPrimes(), 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 graph for printPrimes().

  (e) List test paths that achieve node coverage but not edge coverage ont the graph.

  (f) List test paths that achieve edge coverage but not prime path coverage on the graph.

  Answers:

  (a) Draw the control flow graph for the printPrimes() method:

  (b) 将MAXPRIMES设置为4时,t2会发生数组越界错误,但t1不会发生错误。

  (c) n=1

  (d) Node Coverage

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

   Edge Coverage

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

   Prime Path Coverage

    Test Paths: [1,2,3,4,5,6,7],
          [1,2,3,4,5,6,8,9,10,11],
          [1,2,3,4,5,6,8,9,11],
          [1,2,3,4,5,9,10,11],
          [1,2,3,4,5,9,11],
          [1,2,12,13,14,15],
          [1,2,12,16],
          [2,3,4,5,6,8,9,10,11,2],
          [2,3,4,5,6,8,9,11,2],
          [2,3,4,5,9,10,11,2],
          [2,3,4,5,9,11,2],
          [3,4,5,6,8,9,10,11,2,12,13,14,15],
          [3,4,5,6,8,9,11,2,12,13,14,15],
          [3,4,5,6,8,9,10,11,2,12,13,16],
          [3,4,5,6,8,9,11,2,12,13,16],
          [3,4,5,9,10,11,2,12,13,14,15],
          [3,4,5,9,11,2,12,13,14,15],
          [3,4,5,9,10,11,2,12,13,16],
          [3,4,5,9,11,2,12,13,16],
          [5,6,7,5],
          [6,7,5,9,10,11,2,12,13,14,15],
          [6,7,5,9,11,2,12,13,14,15],
          [6,7,5,9,10,11,2,12,13,16],
          [6,7,5,9,11,2,12,13,16],
          [13,14,15,13],
          [14,15,13,16]

软件测试:3.Exercise Section 2.3的更多相关文章

  1. <<C++ Primer>> 第四版Exercise Section 8.4.1 练习题

    For exercise 8.6 // ConsoleApplication10.cpp : 定义控制台应用程序的入口点. // #include "stdafx.h" #incl ...

  2. C++ 容器对象vector和list 的使用

    在<<c++ primer>>第四版Exercise Section 9.3.4 的Exercise 9.20 是这样的一道题目:编写程序判断一个vector<int&g ...

  3. vector 对象中存放指针类型数据

    <<C++ Primer>> 第四版Exercise Section 5.6 的5.1.6 有一道题是这样的:编写程序定义一个vector对象,其每个元素都是指向string类 ...

  4. C 风格字符串相加

    <<C++ Primer>> 第四版Exercise Section 4.3.1 的4.3.0 有如下题目:编写程序连接两个C风格字符串字面值,把结果存储在C风格字符串中.代码 ...

  5. C风格字符串和C++ string 对象赋值操作的性能比较

    <<C++ Primer>> 第四版 Exercise Section 4.3.1 部分Exercise 4.2.9 习题如下: 在自己本机执行如下程序,记录程序执行时间: # ...

  6. C++ Primer 5th Edition自学笔记(1)

    好吧,第一次写东西...如何下手呢...(请无视) -------------------------------------------------------------- Chapter 1. ...

  7. MIT 6.828 JOS学习笔记5. Exercise 1.3

    Lab 1 Exercise 3 设置一个断点在地址0x7c00处,这是boot sector被加载的位置.然后让程序继续运行直到这个断点.跟踪/boot/boot.S文件的每一条指令,同时使用boo ...

  8. Conway's Game of Life: An Exercise in WPF, MVVM and C#

    This blog post was written for the Lockheed Martin Insight blog, sharing here for the external audie ...

  9. CMSC 216 Exercise #5

    CMSC 216 Exercise #5 Spring 2019Shell Jr (”Shellito”) Due: Tue Apr 23, 2019, 11:30PM1 ObjectivesTo p ...

随机推荐

  1. vue css背景图片打包后路径问题

    limit,代表如果小于大约4k则会自动帮你压缩成base64编码的图片,否则拷贝文件到生产目录 name,后面是打包后的路径: loader,后面 limit 字段代表图片打包限制,这个限制并不是说 ...

  2. [转]vux使用教程

    原文:https://blog.csdn.net/revival_liang/article/details/78267992 <1>. 在项目里安装vuxnpm install vux ...

  3. 双网卡绑定一个IP--bond

    双网卡绑定一个IP 步骤1:新建/etc/sysconfig/network-scripts/ifcfg-bond0文件 DEVICE=bond0 ONBOOT=yes BOOTPROTO=stati ...

  4. xPath 用法总结整理

    xPath 用法总结整理   一.xpath介绍 XPath 是一门在 XML 文档中查找信息的语言.XPath 用于在 XML 文档中通过元素和属性进行导航. XPath 使用路径表达式在 XML ...

  5. GitHub看板系统(Project)

    /********************************************************************** * GitHub看板系统(Project) * 说明: ...

  6. POJ - 1222: EXTENDED LIGHTS OUT (开关问题-高斯消元)

    pro:给定5*6的灯的状态,如果我们按下一个灯的开关,它和周围4个都会改变状态.求一种合法状态,使得终状态全为关闭: sol:模2意义下的高斯消元. 终于自己手打了一个初级板子. #include& ...

  7. Win10激活密钥key(可激活所有版本)

    Win10激活密钥key(可激活所有版本) Win10一年的免费升级服务已经到期,用户要使用Win10系统,就需要最新Win10密钥来激活Win10,一般激活Win10系统有两种方式,一个是使用Win ...

  8. windows 通过scoop安装yarn

    首先进入cmd,输入powershell指令,如图 Prompt should now start with "PS " 然后run iex (new-object net.web ...

  9. javaWeb-Servlet工作原理

    1.客户发出请求—>Web 服务器转发到Web容器Tomcat: 2.Tomcat主线程对转发来用户的请求做出响应创建两个对象:HttpServletRequest和HttpServletRes ...

  10. Spock - Document -04- Interaction Based Testing

    Interaction Based Testing Peter Niederwieser, The Spock Framework TeamVersion 1.1 Interaction-based ...