Background for Question 14-20: 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 arr[i]) { temp = arr[j-1]; arrj - 1] = arr[j]; arr[j] = temp; 1. Based on the program above, please draw a control flow graph for it. 1. In your control flow graph, what are the test requirements for edge coverage? 1. List test path(s) that achieves the edge coverage. 1. 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. 1. In your control flow graph, what are the test requirements for edge-pair coverage? 1. List test paths that achieve the edge-pair coverage 1. 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.

Background for Question 14-20: 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 arr[i]) { temp = arr[j-1]; arrj - 1] = arr[j]; arr[j] = temp; 1. Based on the program above, please draw a control flow graph for it. 1. In your control flow graph, what are the test requirements for edge coverage? 1. List test path(s) that achieves the edge coverage. 1. 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. 1. In your control flow graph, what are the test requirements for edge-pair coverage? 1. List test paths that achieve the edge-pair coverage 1. 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.

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 19RQ

See similar textbooks

Similar questions

Write a program in ¢++ that asks the user to enter 10 integers of an array . The program must return the position pointer of an element that is equal to the square of another element.and then print the array example:- array={2.6,8,4,5} ------- 1 is squar of 2 position=3
Write a method to sort a two-dimensional arrayusing the following header: public static void sort(int m[][]) The method performs a primary sort on rows, and a secondary sort on columns.For example, the following array {{4, 2},{1, 7},{4, 5},{1, 2},{1, 1},{4, 1}} will be sorted to {{4, 5},{4, 2},{4, 1},{1, 7},{1, 2},{1, 1}}.
Using JAVA, write a method that swaps two rows of a two-dimensional array. The row indices to be swapped are passed as parameters to the method (Assume row indices are valid indices). Write a test program to demonstrate correct operation of the method.
write a program using pointers to find the smallest index of the large element : often you need to locate the largest element in an array . if an array has multiple elements with the same largest value , find the smallest index of such an element. suppose the array my list is {1,2,3,4,5,5}. so, the largest element is 5 and the smallest index for 5 is 1 .
Program in C The example : #include<stdio.h> int main(){ /* 2D array declaration*/ int disp[2][3]; /*Counter variables for the loop*/ int i, j; for(i=0; i<2; i++) { for(j=0;j<3;j++) { printf("Enter value for disp[%d][%d]:", i, j); scanf("%d", &disp[i][j]); } } //Displaying array elements printf("Two Dimensional array elements:\n"); for(i=0; i<2; i++) { for(j=0;j<3;j++) { printf("%d ", disp[i][j]); if(j==2){ printf("\n"); } } } return 0; } question : In the example above you required the user to input the values for the array. Modify the program in Part 1 so that instead of asking the user for the values of array elements, they are all initialized using a single statement.
C++ PROGRAM Write a program that will get 10 numbers( including duplicate) between 20 and 100and store them in one dimensional array of type int. your program shall delete all ofthem duplicate values and print the final array list.
Java Program. Write a function that returns the index of the smallest element in an array of doubles. If there are more such elements than one, return the last index is fine. Using the following header: int IndexOfSmallestArray(double array[], int size) Finish the function implement only.
Must answer three subparts 14,15,16 Background for Question 14-20: 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; } } } } 14. Based on the program above, please draw a control flow graph for it. Hint: Annotating some statements or conditions on nodes/edges will be very helpful. 15. In your control flow graph, what are the test requirements for edge coverage? 16. List test path(s) that achieves the edge coverage. 17. 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. Hint: Must provide expected outputs. Not matching test paths with their corresponding input/output ( then will give downvote) 18. In your control flow graph, what are…
1. Write a program that compares all four advanced sorting algorithms . To perform the tests, create a randomly generated array of 1,000 elements. What is the ranking of the algorithms? What happens when you increase the array size to 10,000 elements and then 100,000 elements?
Java Quick Sort but make it read the data 10, 7, 8, 9, 1, 5 from a file not an array // Java implementation of QuickSort import java.io.*; class GFG { // A utility function to swap two elements static void swap(int[] arr, int i, int j) { int temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; } /* This function takes last element as pivot, places the pivot element at its correct position in sorted array, and places all smaller (smaller than pivot) to left of pivot and all greater elements to right of pivot */ static int partition(int[] arr, int low, int high) { // pivot int pivot = arr[high]; // Index of smaller element and // indicates the right position // of pivot found so far int i = (low - 1); for (int j = low; j <= high - 1; j++) { // If current element is smaller // than the pivot if…
The Sieve of Eratosthenes is an algorithm that finds all prime numbers up to a given limit, n. It works by creating an array of Booleans, flag, of size n+1, initializing the array to true (assuming every number is a prime number in the beginning), and iteratively traversing the numbers from 2 to n, setting the values of indices that are multiples of other numbers to false. Write a program using the algorithm above, and display all the prime numbers up to 50.
Write program java Create 2D array 4 *5. Ask the user to enter the number inside the array. Print the numbers organized by rows. Calculate the average for each row. Print the least average. Finally, create a method that receives a 2D array to print its elements reverse starting from the last element.