Question

public static boolean primeCheck (int num) int temp; boolean isPrime-true: for(int i-2;i<=num/ 2 ; i++) temp-numsi if (temp=-0) isPrime-false; break; return isPrime Given the above code segment, 1. (30 points) Draw a Control Flow Graph (CFG) for the code. 2. (10 points) Enumerate the Test Requirements for node coverage. Design a set of 3. 4. 5. test cases (input value num) that will satisfy node coverage. (10 points) Enumerate the Test Requirements for edge coverage. Design a set of test cases (input value num) that will satisfy edge coverage (20 points) Enumerate the Test Requirements for edge pair coverage. Design a set of test cases (input value num) that will satisfy edge pair coverage. (30 points) Enumerate the Test Requirements for prime path coverage. Design a set of test cases (input value num) that will satisfy prime path coverage.

Answer 1

First of all lets number the code statements

public static boolean primeCheck(int num)

{

1 int temp;

2 boolean isPrime = true;

3,4,9 for (int i=2; i<=num/2 ; i++)

//for for loop 3 is for intializer statement

//int i=2; 4 for checking condition and at end 9 for i++

{

5 temp=num%i;

6 if(temp==0)

{

7 isPrime = false;

8 break;

}

}

10 return isPrime;

}

Code statements are numbered from 1-8 now lets create

control flow graph(CFG) of the code statement.

l (int temp. ( 3(int i-2 comparison statement of for loop 4 iftemp--0) is false comparison i<-num/2 is false if(temp=-0) is true 10break the for loop