zoukankan      html  css  js  c++  java
  • ST homework4 --- 图覆盖

    /*******************************************************

         * Finds and prints n prime integers

         * Jeff Offutt, Spring 2003

         ******************************************************/

        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 [MAXPRIMES]; // 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 (curPrime % primes[i]==0)

                    { // 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)     Draw control flow graph for the printPrimes() method.

     

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

    A :  Out of bound for array.

    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 go through the body of the while loop.

    A: not visits the while, n = 1 is ok.

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

    1)    Node coverage:

    {0,1,,2,3,4,5,6,7,8,9,10,11}

    2)    Edge coverage:

    {(0,1),(1,2),(1,7),(2,3),(3,4),(3,5),(4,3),(4,11),(11,3),(5,1),(5,6),(6,1),(7,8),(8,9),(9,8),(8,10)}

    3)    {(0,1,7,8,10),(0,1,7,8,9),(0,1,2,3,5,6),(0,1,,2,3,4,11),

    (1,2,3,5,1),(2,3,5,1,2),(3,5,1,2,3),(51,2,3,5),(3,4,11,3),(4,11,3,4),

    (11,3,4,11),(1,2,3,5,6,1),(2,3,5,6,1,2),(3,5,6,1,2,3),(5,6,1,2,3,5),(6,1,2,3,5,6),(8,9),(9,8),

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

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

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

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

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

  • 相关阅读:
    [Tips] kubeconfig合并
    某书补充题选做
    Card
    Ant Design Pro V5 使用 Cesium 地图开发包遇到加载widgets.css样式报错
    工作相关
    pc端谷歌浏览器长截图
    dao层与xml之间联系
    三周的大学生活,我到底是怎么过来的
    湖南大学推荐书《社会学大纲》阅读有感 其二
    湖南大学新生报到游记 其一
  • 原文地址:https://www.cnblogs.com/CsharpNote/p/5366829.html
Copyright © 2011-2022 走看看