zoukankan      html  css  js  c++  java
  • Software Testing 3

    Questions:

    • 7. Use the following method printPrimes() for questions a–d.

    基于Junit及Eclemma(jacoco)实现一个主路径覆盖的测试。

     1 /*****************************************************************
     2  * Finds and prints n prime integers
     3  * Jeff Offutt, Spring 2003
     4 *****************************************************************/
     5 private static void printPrimes(int n)
     6 {
     7     int curPrime; // Value currently considered for primeness
     8     int numPrimes; // Number of primes found so far;
     9     boolean isPrime; // Is curPrime prime?
    10     int[] primes = new int[MAXPRIMES]; // The list of prime numbers.
    11        
    12     // Initialize 2 into the list of primes.
    13     primes[0] = 2;
    14     numPrimes = 1;
    15     curPrime = 2;
    16     while(numPrimes < n)
    17     {
    18         curPrime++; // next number to consider...
    19         isPrime = true;
    20         for(int i = 0; i <= numPrimes-1; i++)
    21         {   // for each previous prime.
    22             if(isDivisible(primes[i], curPrime))
    23             { // Found a divisor, curPrime is not prime.
    24                 isPrime = false;
    25                 break; // out of loop through primes.
    26             }
    27         }
    28         if(isPrime)
    29         {   // save it!
    30             primes[numPrimes] = curPrime;
    31             numPrimes++;
    32         }
    33     } // End while
    34 
    35     // print all the primes out.
    36      for(int i = 0; i <= numPrimes-1; i++)
    37     {
    38         System.out.println("Prime: " + primes[i]);
    39     }
    40 }// End printPrimes.

    (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 printPrimes(), 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 path for printPrimes().


     

    Answers:

    (a)

    (b) MAXPRIMES >= n

    所以当MAXPRIMES = 4时,t2会发生数组越界,而t1不会。

    (c) n = 1;

    (d)点覆盖:TR = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}

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

    主路径覆盖:

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

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

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

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

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

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

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

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

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

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

    (12, 13, 14, 12),

    (13, 14, 12, 15),(13, 14, 12, 13),

    (14, 12, 13, 14)}

     

    (附加)基于Junit及Eclemma(jacoco)实现一个主路径覆盖的测试:

    首先,假设MAXPRIMES=10并补全代码;

    其次,确定测试用例并编写测试文件;

  • 相关阅读:
    .net软件反编译笔记
    Asp.Net 网站一键部署技术(上)
    C# TreeGridView 实现进程列表
    HeidiSQL Navicat
    Flask项目中邮箱模块的应用
    如何在已有的Flask项目添加数据表结构?
    把u盘刻录成系统盘
    Object '<Tbl_next_week_change_state at 0x7f2c78d849e8>' is already attached to session '4' (this is '6')
    OSError: [Errno 98] Address already in use
    Linux下设置和查看环境变量
  • 原文地址:https://www.cnblogs.com/fogmisty/p/8617990.html
Copyright © 2011-2022 走看看