软件测试: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. 浅谈MVC中的service层(转)

    概述 mvc框架由model,view,controller组成,执行流程一般是:在controller访问model获取数据,通过view渲染页面. mvc模式是web开发中的基础模式,采用的是分层 ...

  2. Favorite Donut(HDU 5442)最小表示法+二分

    题目给出一个字符串,由a~z表示甜度,随字典序增大,字符串首尾相连形成一个圈,要求从一个位置开始字典序最大的字符串,输出位置以及是顺时针还是逆时针表示.顺时针用0表示,逆时针用1表示. 此题只需要查找 ...

  3. PHP数据库连接mysql与mysqli的区别与用法

    一.mysql与mysqli的概念相关: 1.mysql与mysqli都是php方面的函数集,与mysql数据库关联不大. 2.在php5版本之前,一般是用php的mysql函数去驱动mysql数据库 ...

  4. java项目---用java重命名文件(1星)

    package Demo; import java.io.File; public class FileRename { public static boolean Rename(String old ...

  5. C++ 实验3 类和对象

    Part 2 #ifndef GRAPH_H #define GRAPH_H class Graph { public: Graph(char ch, int n); void draw(); pri ...

  6. 中间件和Django缓存

    中间件定义: 中间件是一个.一个的管道,如果相对任何所有的通过Django的请求进行管理都需要自定义中间件 中间件可以对进来的请求和出去的请求进行控制 中间件是一类. 看下面的代码在settings里 ...

  7. 第五章HTML

    HTML介绍 标签:有一个头,一尾 <!DOCTYPE html><html lang="en"><head> <!-- 文档的标题.编码 ...

  8. cellmap 基站查询 for android

    cellmap for android 3.6.8.8.1.8 更新日期:2019年4月28日 特别声明:本软件不能进行手机定位,不能对手机号码定位,谨防被骗. 安装说明:请卸载旧版本后,重新下载安装 ...

  9. 19.2 MEMORY CONTROLLER

    在存储控制器的BANKCONTROLREGISTER(BANKCONn: GCS6-nGCS7)表中:中文翻译各个寄存器的位出现错误: 原文中正确的表述见下图:

  10. Ant将Jmeter的jtl文件转为html文件报“前言中不允许有内容”

    ant执行jmeter的脚本的时候提示“Fatal Error! 前言中不允许有内容” 解决办法: 在jmeter的bin目录中找到jmeter.properties: 将文件中#jmeter.sav ...