solve in java Integer arrays originalArr and filterArr are read from input, each containing two elements. If an element in originalArr is not a multiple of the corresponding element in filterArr, replace the element in originalArr with the corresponding element in filterArr times 2. Ex: If the input is: 16 9 8 4 then the output is: 16 8 Note: Given integers A and B, A is a multiple of B only if A % B == 0. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 import java.util.Scanner; public class ReplaceNumbers { publicstaticvoidmain(String[] args) { Scannerscnr=newScanner(System.in); finalintNUM_VALS=2; int[] originalArr=newint[NUM_VALS]; int[] filterArr=newint[NUM_VALS]; inti; for (i=0; i<NUM_VALS; ++i) { originalArr[i] =scnr.nextInt(); } for (i=0; i<NUM_VALS; ++i) { filterArr[i] =scnr.nextInt(); } /* Your code goes here */ for (i = 0; i < originalArr.length; ++i) { System.out.print(originalArr[i] + " "); } System.out.println(); }}

solve in java Integer arrays originalArr and filterArr are read from input, each containing two elements. If an element in originalArr is not a multiple of the corresponding element in filterArr, replace the element in originalArr with the corresponding element in filterArr times 2. Ex: If the input is: 16 9 8 4 then the output is: 16 8 Note: Given integers A and B, A is a multiple of B only if A % B == 0. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 import java.util.Scanner; public class ReplaceNumbers { publicstaticvoidmain(String[] args) { Scannerscnr=newScanner(System.in); finalintNUM_VALS=2; int[] originalArr=newint[NUM_VALS]; int[] filterArr=newint[NUM_VALS]; inti; for (i=0; i<NUM_VALS; ++i) { originalArr[i] =scnr.nextInt(); } for (i=0; i<NUM_VALS; ++i) { filterArr[i] =scnr.nextInt(); } /* Your code goes here */ for (i = 0; i < originalArr.length; ++i) { System.out.print(originalArr[i] + " "); } System.out.println(); }}

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 24PE

See similar textbooks

Similar questions

FOR JAVA Write a Java method that takes two 2 dimensional int arrays (a and b) and a 2 dimensional boolean array (c) where all three arrays have the same size. Your method should return an array (result) such that, if a partic- ular element in c is true, then the corresponding (same indexed) element in result must be the multiplication of the the corresponding elements of a and b. If the element in c is false, then the the corresponding element in result must be the negative of multiplication of the the corresponding element in a and b. For example ifa = {{1,2,3},{4,5}},b = {{1,2,1},{0,2}} andc = {{true,false,true},{false,true}}, then the result should be result={{1, -4, 3}{0, 10}}.
Write a Java method that takes two 2 dimensional int arrays (a and b) anda 2 dimensional boolean array (c) where all three arrays have the samesize. Your method should return an array (result) such that, if a particular element in c is true, then the corresponding (same indexed) elementin result must be the multiplication of the the corresponding elements ofa and b. If the element in c is false, then the the corresponding elementin result must be the negative of multiplication of the the correspondingelement in a and b.
The solution must be submitted in the Coral programming language. A program that reads a list of 10 integers, and outputs those integers in reverse. For coding simplicity, follow each output integer by a space, including the last one. Then, output a newline. Ex: If the input is 2 4 6 8 10 12 14 16 18 20, the output is: 20 18 16 14 12 10 8 6 4 2 To achieve the above, first read the integers into an array. Then output the array in reverse.
solve in java Given the integer array averageMiles with the size of NUM_ELEMENTS, write a for loop to output the integers in the first half of averageMiles in reverse order. Separate the integers with a dash surrounded by spaces (" - "). Ex: If the input is 75 84 39 85 115 118 48 50, then the output is: 85 - 39 - 84 - 75 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 import java.util.Scanner; public class MileData { publicstaticvoidmain(String[] args) { Scannerscnr=newScanner(System.in); finalintNUM_ELEMENTS=8; int[] averageMiles=newint[NUM_ELEMENTS]; inti; for (i=0; i<averageMiles.length; ++i) { averageMiles[i] =scnr.nextInt(); } for (/* Your code goes here */) { /* Your code goes here */ } System.out.println(); } }
First, write a Java method merge that takes as parameter a non-empty double array representing employees’ salaries. The method merges the values of every 2 adjacent elements. put the merged values at the beginning of the array, and put 0 in the remaining positions. Suppose that the original array will contain an even number of elements. Second, write two java methods readArray(int[]a) and printArray(int[]a) that reads/writes the elements of an array passed in parameter from/to the standard input/output. Finally, Use the following main method to test your different methods: public class MergeSalary { private static Scanner input = new Scanner(System.in); public static void main(String[] args) { } } double[] salaries = new double[10]; System.out.print("Enter 10 salaries: "); readArray(salaries); merge(salaries); System.out.print("Salaries after merge: "); printArray(salaries); Hint: For the method merge, you can work on the same array or use a temporary array. Run example:…
First, write a Java method merge that takes as parameter a non-empty double array representing employees’ salaries. The method merges the values of every 2 adjacent elements. put the merged values at the beginning of the array, and put 0 in the remaining positions. Suppose that the original array will contain an even number of elements. Second, write two java methods readArray(int[]a) and printArray(int[]a) that reads/writes the elements of an array passed in parameter from/to the standard input/output. Finally, Use the following main method to test your different methods:
Write a program in java for the below given problem statement: Given 2 sorted arrays (in increasing order), find a path through the intersection that produces themaximum sum and return the maximum sum. That is, we can switch from one array to another array only atcommon elements. If no intersection element is present, we need to take the sum of all elements from thearray with greater sum.Sample Input:61 5 10 15 20 2552 4 5 9 15Sample Output :81Explanation :We start from array 2 and take sum till 5 (sum = 11). Then we'll switch to array at element 10 and take till15. So sum = 36. Now, no elements are left in array after 15, so we'll continue in array 1. Hence the sum is81.
Write a program that reads an array A of N elements containing only 0's and 1's. Your program should find the position of a 0 and replace it with a 1 to get the longest continuous sequence of 1's. Let this position of 0 be called P. Print P if such a 0 exists and print -1 if the original array A contains only 1's. Assume the array indexing starts from 0.
Java. Implement a method that will return a String with an array's elements separated by spaces. The mehod will recieve three parameters: the integer array, a start index, and an end index. Both start and end are includive. The method's signature is as follows: public static String printRange(int [], int, int) - make the method public to faciliate testing - If the indexes are outside the bounds of the array, the method should return "Invalid Range." Otherwise, the method will return a String containing one integer after the other on the same line separated by one space. Example 1: Given {4,1,2,36,6}, 1, 3 as the parameters; the method should return "1 2 36" Example 2: Given {4,1,2,36,6}, 0, 7 as the parameters; the method should return "Invalid Range"
Java Bubble Sort but make it read the data 64, 34, 25, 12, 22, 11, 90 from a file not an array // Java program for implementation of Bubble Sort class BubbleSort { void bubbleSort(int arr[]) { int n = arr.length; for (int i = 0; i < n - 1; i++) for (int j = 0; j < n - i - 1; j++) if (arr[j] > arr[j + 1]) { // swap arr[j+1] and arr[j] int temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; } } /* Prints the array */ void printArray(int arr[]) { int n = arr.length; for (int i = 0; i < n; ++i) System.out.print(arr[i] + " "); System.out.println(); } // Driver method to test above public static void main(String args[]) { BubbleSort ob = new BubbleSort(); int arr[] = { 64, 34, 25, 12, 22, 11, 90 }; // make it read from a file instead of having…
Write a Java program that• Define an integer array with length of 10.• Populate the array with random integer numbers.• Sort this array into non-decreasing order based on three sorting algorithms.o bubble sorto selection sorto insertion sort• Test these 3 sorting methods• Give a big-Oh characterization, in terms of n, of the running time of these three algorithms.• I mprove the bubble sort so that the time complexity of them are O(N) for the best case Write a Java program that• Define an integer array with length of 100.• Populate the array with random numbers in {1, 2, ..., 30}.• Count and output the frequency of each number occurred in the array.• Give a big-Oh characterization, in terms of n, of the running time of this algorithm.
reversing the elements of an array involves swapping the corespodning elements of the array: the first with the last, the second with the next to the last, and so on, all the way to the middle of the array. given an array a, an int variable n containing the number of elements in a, and two other int variables, k and temp, write a loop that reverses the elements of the array. do not use any other variables besides a, n, k, and temp. in c++