In python langauge, write a function that adds a random noise to all elements of a NumPy array Code:  import numpy as np import math import matplotlib.pyplot as plt import pandas as pd   def addNoise(inputArray):   modifiedArray = np.zeros(len(inputArray))   #YOUR CODE HERE:   return(modifiedArray)

Your Friendly Array Neighbor   Program only in java not in python Create a Java program that takes an array called ar as an input that keeps track of arrays. Every day a new array is produced using the array of the previous day. On the n’th day, the following operations are performed on the array of day n – 1 to produce the array of day n:   -If an element is smaller than both left and right neighbor, then this element is incremented -If an element is bigger than both its left neighbor and its right neighbor, then this element is decremented. -The first and last elements should never change   Eventually after some days the array will not change, some examples:   Example: Input from user: ar = [6,2,3,4] Output from program: [6,3,3,4] After the first day the array is changed from [6,2,3,4] to [6,3,3,4] and no further operations may be completed.   Example: Input from user: ar = [1,6,3,4,3,5] Output from program: [1,4,4,4,4,5]   After the first day the array is changed from [1,6,3,4,3,5]…

java - netbeans

public int[] bubbleSort(int[] array) {int n = array.length;int temp = 0;}

In C++ whats the answer from below ? int size = 10; for ( int i = -1; i < size ; i++) { arr[size - i] = i; } This array:     has 12 positions     is out of bounds     has 10 positions     has 11 positions

python exercise Given the following list: testlist2 = (23,50,12,80,10,90,34,78,4,19,53)   Use testlist2 to create Numpy array of int16 and then display the array. Display the number of dimension of testnp. Display the shape of testnp. Display the number of bytes of testnp. Display the mean, sum, max, and min of testnp.

//Required Functionvoid func(int array_1[],int array_2[],int size){   for(int i=0;i<size;i++){      if(array_2[i]>array_1[i]){         array_1[i]=array_2[i];      }   }   return;} //main function to test the function.int main(){    int size=6;    int a[]={1,5,9,8,7,6};    int b[]={1,4,10,12,7,15};    printf("First array before function call: ");    for(int i=0;i<size;i++){       printf("%d ",a[i]);    }    func(a,b,size);  //call to the created function    printf("\nFirst array after function call: ");    for(int i=0;i<size;i++){       printf("%d ",a[i]);    }        return 0;} 1. Write the statements to do the following: write a prototype for your function in the previous problem write a main function which includes the following steps declare two arrays of ints with 25 elements each prompt the user and read values into both arrays call your function from the previous problem print both arrays

///////1/////. Given an array of integers, write a PHP function to find the maximum element in the array. PHP Function Signature: phpCopy code function findMaxElement($arr) { // Your code here } Example: Input: [10, 4, 56, 32, 7] Output: 56 You can now implement the findMaxElement function to solve this problem. Let me know answer. //. .

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()

def removeMultiples(x, arr) - directly remove the multiples of prime numbers (instead of just marking them) by creating a helper function. This recursive function takes in a number, n, and a list and returns a list that doesn’t contain the multiples of n.def createList(n) - a recursive function, createList(), that takes in the user input n and returns an array of integers from 2 through n (i.e. [2, 3, 4, …, n]). def Sieve_of_Eratosthenes(list) -  a recursive function that takes in a list and returns a list of prime numbers from the input list.Template below: def createList(n):    #Base Case/s    #ToDo: Add conditions here for base case/s    #if <condition> :        #return <value>      #Recursive Case/s    #ToDo: Add conditions here for your recursive case/s    #else:        #return <operation and recursive call>     #remove the line after this once all ToDo is completed    return [] def removeMultiples(x, arr):      #Base Case/s    #TODO: Add conditions here for your…