Below is a bubble sort program that sorts the elements in an array. static void bubbleSort(int] arr) { arr.length; int temp = 0; for (int i = 0; i arrli) { int n = temp = arrlj - 1); arrlj - 1] = arrlil: arrli) = temp; %3D Based on the program above, please draw a control flow graph for it. In your control flow graph, what are the test requirements for edge coverage List test path(s) that achieves the edge coverage. 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. In your control flow graph, what are the test requirements for edge-pair coverage? List test paths that achieve the edge-pair coverage Provide test cases for each test path you list in the previous question. If it is not possible to find the test nput for certain test path, describe the reason.

#include <stdio.h> struct Single {     int num; };   void printSingle(int f) {     int binaryNum[33];     int i = 0;     while(f>0)     {         binaryNum[i] = f % 2;         f = f/2;         i++;     }     for (int j=i-1; j>= 0; j--)     {         printf("%d",binaryNum[j]);     } }   int main() {     struct Single single;     single.num = 33;     printf("Number: %d\n",single.num);     printSingle(single.num);     return 0; }

An array int[] intArray can be initialized during its definition by   A.) It can't be initialized   B.) by writing int[] intArray = {1.0f};   C.) by writing int[] intArray = {0,1,2};   D.) by writing int[0-10] intArray = {0,1,2,3,4,5,6,7,8,9};

Write a loop that counts how many elements in an array are equal to zero. arrays.cpp 1 #include // sizet 2 int countZeros (const int values[], size_t size) { int count = 0; 3 4 for (int i; i using namespace std; 3 2 4 int countZeros(const int values[], size_t size); 5 int main() { int a[] = {1, 2, 0, 3}; cout <« countZeros (a, 4) <« endl; cout « "Expected: 1" « endl; 6 7 8 9 10 11 int b[] = {0, 2, 0, 3}; cout <« countZeros (b, 4) <« endl; cout « "Expected: 2" « endl; 12 13 14 15 int cl] -{1, 0, θ, 0, 0 ; cout <« countZeros (c, 5) <« endl; cout « "Expected: 4" « endl; 16 17 18 19 } CodeCheck Reset Testers Running Tester.cpp pass fail fail 1 Expected: 1 Expected: 2 Expected: 4 Score 1/3

Java Programming language Please help me with this question

class Main {             // this function will return the number elements in the given range             public static int getCountInRange(int[] array, int lower, int upper)             {                         int count = 0; // to count the numbers                         // this loop will count the numbers in the range                         for (int i = 0; i < array.length; i++)                         {                     // if element is in the range                                     if (array[i] >= lower && array[i] <= upper)                                                 count++;                         }                                                 return count;             }               public static void main(String[] args)             {         // array         int array[] = {1,2,3,4,5,6,7,8,9,0};                         // ower and upper range                         int lower = 1, upper = 9;                         // throwing an exception…

In JAVA language, find the product of all positive elements present in the array given below and display the product in the output. int []num = {12, -2, 4, 16, -17, 0, 21}; %3D

Prompt: In Python language, write a function that applies the logistic sigmoid function to all elements of a NumPy array. Code:   import numpy as np import math import matplotlib.pyplot as plt import pandas as pd   def sigmoid(inputArray):               modifiedArray = np.zeros(len(inputArray))               #YOUR CODE HERE:               return(modifiedArray) def test(): inputs = np.arange(-100, 100, 0.5) outputs = sigmoid(inputs) plt.figure(1) plt.plot(inputs) plt.title('Input') plt.xlabel('Index') plt.ylabel('Value') plt.show() plt.figure(2) plt.plot(outputs,'Black') plt.title('Output') plt.xlabel('Index') plt.ylabel('Value') plt.show() test()

public int binarySearch(int[]array, int num) {int low = 0;//low rangeint high = array.length -1; //high range int mid; //mid rangewhile () //while low is less than or equal to high{mid = ; //set middle range to be (low + high) /2if () { //if the array in the middle range = input number//return mid range }elseif () { //if the array in the middle range > input number//set the high value to be the mid value minus 1 }else{//set low value to be mid value plus one } }//return -1 here because that would mean that the number is not found in the loop}

Enhanced selection sort algorithm SelectionSortDemo.java  package chapter7; /** This program demonstrates the selectionSort method in the ArrayTools class. */ public class SelectionSortDemo { public static void main(String[] arg) { int[] values = {5, 7, 2, 8, 9, 1}; // Display the unsorted array. System.out.println("The unsorted values are:"); for (int i = 0; i < values.length; i++) System.out.print(values[i] + " "); System.out.println(); // Sort the array. selectionSort(values); // Display the sorted array. System.out.println("The sorted values are:"); for (int i = 0; i < values.length; i++) System.out.print(values[i] + " "); System.out.println(); } /** The selectionSort method performs a selection sort on an int array. The array is sorted in ascending order. @param array The array to sort. */ public static void selectionSort(int[] array) { int startScan, index, minIndex, minValue; for (startScan = 0; startScan < (array.length-1); startScan++) { minIndex = startScan; minValue…