Requirements: Use Java Programming only. Show screenshots of your work. 6. Write method public static int linearSearch(int [] arr, ine key) which returns the largest index such that arr[index] matches the key. If there is match, returns -1. 7. Write method public static double average(int [] arr) which returns the average of all elements in given array arr. Assume that arr has length at least 1. 8. Write method public void crazyPrint(String sentence, int n) which print out the given sentence n times. Assume n is positive integer.

Requirements: Use Java Programming only. Show screenshots of your work. 6. Write method public static int linearSearch(int [] arr, ine key) which returns the largest index such that arr[index] matches the key. If there is match, returns -1. 7. Write method public static double average(int [] arr) which returns the average of all elements in given array arr. Assume that arr has length at least 1. 8. Write method public void crazyPrint(String sentence, int n) which print out the given sentence n times. Assume n is positive integer.

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Similar questions

Requirements: Use Java Programming only. Show screenshots of your work. this is the second time I posted this since the previous answer is very wrong. 6. Write method public static int linearSearch(int [] arr, ine key) which returns the largest index such that arr[index] matches the key. If there is match, returns -1. 7. Write method public static double average(int [] arr) which returns the average of all elements in given array arr. Assume that arr has length at least 1. 8. Write method public void crazyPrint(String sentence, int n) which print out the given sentence n times. Assume n is positive integer.
Write method findZero, as started below. findZero should return the index of the first element of array A that contains the value zero, starting from position 0 up through position pos. If no element of A from position 0 to position pos contains the value zero, then findZero should return –1. For example:(in java) Array (A) Position (pos) Value returned by findZero(A, pos) 1 0 2 5 6 0 -1 1 0 2 5 6 1 1 1 0 2 5 6 2 1 1 0 2 0 6 2 1 1 0 2 0 6 4 1 1 2 3 4 5 4 -1 Complete method findZero below. Assume that it is called only with values that satisfy its assumptions as stated below. // Description: Returns smallest index k // such that (0 <= k <= pos) and (A[k] == 0) // Assumptions: 0 <= pos < A.length public int findZero(int[] A, int pos) {
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}}.
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.
In Java: Given two Arrays of equal length(arrayA & arrayB), for every element in arrayA, add the coresponding element from arrayB that are in the same index. Example: arrayA = {1, 2, 3, 4} arrayB = {2, 4, 6, 8} Output result of the state of arrayA: arrayA = {3, 6, 9, 12}
write an java code: Using quick sort algorithm to find the largest value in an unsorted array. give the example of key value that would lead to worse case running time. test case 1) arr1 = { 1,5,24,2,33,48,6,22,14,7,28,9} test case 2) arr1 = {88, 6,75,25,37,3,386,277,4,78,97,39,18,201,178,60}
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 method findZero, as started below. findZero should return the index of the first element of array A that contains the value zero, starting from position 0 up through position pos. If no element of A from position 0 to position pos contains the value zero, then findZero should return –1. For example: Array (A) Position (pos) Value returned by findZero(A, pos) 1 0 2 5 6 0 -1 1 0 2 5 6 1 1 1 0 2 5 6 2 1 1 0 2 0 6 2 1 1 0 2 0 6 4 1 1 2 3 4 5 4 -1 Complete method findZero below. Assume that it is called only with values that satisfy its assumptions as stated below. // Description: Returns smallest index k // such that (0 <= k <= pos) and (A[k] == 0) // Assumptions: 0 <= pos < A.length public int findZero(int[] A, int pos) {
Write a Java class to perform the following: 1. Write a method to search the following array using a linear search, ( target elements: 11, 55, 17.). (count the number of comparisons needed). {06, 02, 04, 07, 11, 09, 50, 62, 43, 32, 13, 75, 01, 46, 88, 17} 2. Write a method to sort the array using Selection Sort. (count the number of comparisons needed) 3, Write a method to sort the array using Bubble Sort. (count the number of comparisons needed) 4, Search he sorted array using a binary search (recursive) for the same set of target elements. (count the number of comparisons needed)
Write a JAVA program to find the unique element which is present only once in the given array. All the remaining elements are repeated twice in the array. int []a = {2, 14, 6, 22, 2, 34, 22, 8, 6, 14, 8}; Use constant space and linear time.
1) You need to use JavaScript to modify a repeated element of unknown count on the page that is different on each page visit. What is the best way to do this?: A) Use document.getElementsByTagName(), then use the return like an array. B) Manually label each element Id, then use document.getElementById(). C) Give the same Id to each element, then use getElementById() like an array. D) Use the highest common parent element, then use recursive search. 2) You are in charge of writing a JavaScript code to tell the user how well his/her password is as it is typed in. What is the best approach? A) Add onsubmit to submit button. Show message if password is weak and return false. B) Add onsubmit to submit button. Disable update button if password is too weak. C) Add onchange to password field. Update a message as password is changed. D) Add onfocusout to password field. Update a message as password is changed 3) What event can we use to animate a picture once it is downloaded?: A) onchange B)…