Below is a bubble sort program that sorts the elements in an array.
static void bubbleSort(int[] arr) {
int n = arr.length;
int temp = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j < (n – i); j++) {
if (arr[j – 1] > arr[j]) {
temp = arr[j – 1];
arr[j – 1] = arr[j];
arr[j] = temp;
}
}
}
}
1. Based on the program above, please draw a control flow graph for it. (7 pts.) Hint: Annotating some statements or conditions on nodes/edges will be very helpful.
2. In your control flow graph, what are the test requirements for edge coverage? (4 pts.)
3. List test path(s) that achieves the edge coverage. (5 pts.)
4. Provide test cases for each test path you list in the previous question. If it is not possible to find the test input for certain test path, describe the reason. (5 pts.)
Hint: Not providing expected outputs will get 2 points deduction. Not matching test paths with their corresponding input/output will get 3 points deduction.
5. In your control flow graph, what are the test requirements for edge-pair coverage? (6 pts.)
6. List test paths that achieve the edge-pair coverage. (6 pts.)
7. Provide test cases for each test path you list in the previous question. If it is not possible to find the test input for certain test path, describe the reason. (6 pts
