軟體測試圖覆蓋

標籤：

 public static void printPrimes (int n)     {         int curPrime;          int numPrimes;         boolean isPrime;         int [] primes = new int [MAXPRIMES];          primes [0] = 2;         numPrimes = 1;         curPrime = 2;         while (numPrimes < n)         {             curPrime++;             isPrime = true;             for (int i = 0; i <= numPrimes-1; i++)             {                if (curPrime%primes[i]==0)                 {                      isPrime = false;                     break;                 }             }             if (isPrime)             {                 primes[numPrimes] = curPrime;                 numPrimes++;             }         }                 for (int i = 0; i <= numPrimes-1; i++)         {             System.out.println ("Prime: " + primes[i]);         } 

一、控制流程圖

二、測試案例t1=(n=3),和t2=(n=5),t2容易發生二t1不容易發生的錯誤是：數組越界問題。

三、n=1時，相應的測試路徑訪問串連while語句開始到for語句的邊，而不用通過while迴圈體。

四、節點覆蓋：{0,1,2,3,4,5,6,7,8,9,10,11,12}

     邊覆蓋：{(0,1),(1,2),(2,3),(3,4),(4,5),(5,7),(4,6),(3,7),(7,9),(6,3),(7,8),(8,9),(1,9),(9,10),(10,11),(11,10),(10,12)}

    主路徑覆蓋:{(0,1,2,3,4,5,7,8,9,10,11,),(0,1,2,3,4,5,7,8,9,10,12),(0,1,2,3,4,5,7,9,10,11),(0,1,2,3,4,5,7,9,10,12),(0,1,2,3,4,6),

                     (0,1,9,10,12),(10,11,10),(11,10,11),(3,4,6,3),(4,6,3,4),(6,3,4,6)}

 

五、主路徑覆蓋

 

軟體測試圖覆蓋