In a program, write a method that accepts two arguments: an array of integers and a number n. The method should print all of the numbers in the array that are greater than the number n (in the order that they appear in the array, each on their own line). In the same file, create a main method and call your function using the following data sets: The array {1, 5, 10, 2, 4, -3, 6} and the number 3. The array {10, 12, 15, 24} and the number 12.

In a program, write a method that accepts two arguments: an array of integers and a number n. The method should print all of the numbers in the array that are greater than the number n (in the order that they appear in the array, each on their own line). In the same file, create a main method and call your function using the following data sets: The array {1, 5, 10, 2, 4, -3, 6} and the number 3. The array {10, 12, 15, 24} and the number 12.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Write a method SortTheEvens(), that first shifts all the even numbers of an input array to the left side in that array and then sorts all even numbers in that array.Note: You are not allowed to use direct indexing and can only use ptr++ and ptr-- operators. i.e. *(ptr + i) and ptr[i] are not allowed.Do using c++ programming language.
Write a void method selectionSortDescendTrace() that takes an integer array, and sorts the array into descending order. The method should use nested loops and output the array after each iteration of the outer loop, thus outputting the array N-1 times (where N is the size). Complete main() to read in a list of up to 10 positive integers (ending in -1) and then call the selectionSortDescendTrace() method. If the input is: 20 10 30 40 -1 then the output is: 40 10 30 20 40 30 10 20 40 30 20 10
Write a static method: public static double intersectionSum(double[] a, double[] b) that takes two double arrays as arguments and returns the sum of the elements the two arrays have in common. In other words, the result should be the sum of every element in the two arrays where a[i] is equal to b[i] for some index i. Note that the two arrays may not be the same length. In these cases, you should only consider the indices that the arrays have in common (the indices of the shorter array). If either (or both) arrays are empty or null, the result should be 0.0. Example 1: intersectionSum({3.0, -4.0, 5.8, 6.75}, {3.0, 2.5, 5.8, 4.95}) è 8.8, since a[0] == b[0] and a[2] == b[2] and 3.0 + 5.8 = 8.8 Example 2: intersectionSum({8.5, 9.75, 1.25}, {3.5, 9.75, 1.25, 8.5, -2.34}) è11.0, since a[1] == b[1] and a[2] == b[2] and 9.75 + 1.25 = 11.0
Use Java programming. Write the removeEvens() method, which receives an array of integers as a parameter and returns a new array of integers containing only the odd numbers from the original array. The main program outputs values of the returned array. Hint: If the original array has even numbers, then the new array will be smaller in length than the original array and should have no blank elements. Ex: If the array passed to the removeEvens() method is [1, 2, 3, 4, 5, 6, 7, 8, 9], then the method returns and the program output is: [1, 3, 5, 7, 9] Ex: If the array passed to the removeEvens() method is [1, 9, 3], then the method returns and the program output is: [1, 9, 3] import java.util.Arrays; public class LabProgram { public static int[] removeEvens(int [] nums) { /* Type your code here */} public static void main(String[] args) { int [] input = {1,2,3,4,5,6,7,8,9};int [] result = removeEvens(input); // Helper method Arrays.toString() converts int[] to a…
Write the method printTail() method that accepts an array of integers and an integer index as parameters and prints all the array elements starting from the index passed. For example if printTail(x,5) is invoked, it should print all the elements of the array x starting at x[5].
Write a Java program that will allow the user to play a hangman game repeatedly until theychoose to stop. The game should randomly choose a secret word from a pre-set list of wordsfor the user to guess. Store the list of words available for play in an array so you can randomlychoose them by index during game play.During a turn, the user will guess one letter at a time. Each letter in the secret word shoulddisplay as an asterisk until the letter is guessed by the user. When a correct letter is guessed,the letter should be displayed in the correct position in place of the asterisk. The user hangshimself with the 8th wrong guess and loses the game.Make a character array to hold the characters and asterisks representing the word beingguessed. You can change the contents of this array as the letters are guessed and revealed. Inother words, this array can be used to display the current state of the secret word each round.Here is the list of words the game should choose from for the secret…
In Java Write a program that counts the number of occurrences of lowercase and uppercase vowels inentered lines of text. Use a two-dimensional array to store the vowel counts. The array’s firstcolumn holds the counts for the lowercase vowels, and the second column holds the counts forthe uppercase vowels.The user indicates the end of the input by pressing enter by itself. At that point, your programshould print, for each vowel, the total number of lowercase occurrences, the total number ofuppercase occurrences, and the total number of combined occurrences.Here are some implementation requirements:1. Use two separate files – one for a main driver method and one for a VowelCounter classthat keeps track of vowel counts.2. main – Repeatedly prompt the user to enter a line of text or press enter by itself to quit.Note that the stdIn.nextLine() method returns the empty string ("") if the user pressesenter by itself. For each entered line of text, call the processLine method. When the…
Write a method thattakes an integer array as its parameter and sorts the contents of the array inascending order using the Insertion Sort algorithm. Call this method after the original array (original program below) and other stats have been displayed. Once the array hasbeen sorted by your method, display its contents to the screen in the samemanner as the original array was displayed. import java.util.Random;import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scnr = new Scanner(System.in); System.out.println("How many numbers to store?"); //input array size int size = scnr.nextInt(); //creating array double[] array = new double[size]; //fill array with random numbers in range 1-999 inclusive randomArray(array, size, 1, 999); //find smallest, largest and average compute(array, size); } //method to fill array with randoms numbers within range min to max and print them private static…
1. Write a static method called runningSum that accepts an array parameter, populated with a sequence of real numbers that are read from a file. The program outputs the running sum of the numbers followed by the maximum running sum. For example, if the array contains the following data: 3.25 4.5 -8.25 7.25 3.5 4.25 -6.5 5.25 your method should produce the following output: running sum = 3.25 7.75 -0.5 6.75 10.25 14.5 8.0 13.25 max sum = 14.5 2. Arrays a1, a2… are populated as shown; display a[i] for each calls to arr; if a[i] less than or equal to 0 display a message indicating those conditions public static void arr(int[] a) { //Add the missing loop a[i] = a[i + 1] + a[i - 1]; // display a[i] } }
FOR JAVA Write a method that takes a one dimensional integer array and an integer, and returns the index of the integer in the array. If the integer is not in the array, your program must return -1. If there are multiple occurrences of that number, your program must return the smallest index. Repeat the second question, but if there are multiple occurrences of the number, your program must return the largest index instead of the small- est.
Define a method named swapValues that takes an array of four integers as a parameter, swaps array elements at indices 0 and 1, and swaps array elements at indices 2 and 3. Then write a main program that reads four integers from input and stores the integers in an array in positions 0 to 3. The main program should call function swapValues() to swap array's values and print the swapped values on a single line separated with spaces. Ex: If the input is: 3 8 2 4 function swapValues() returns and the main program outputs: 8 3 4 2 The program must define and call a method:public static void swapValues(int[] values)
Write a method that returns a new array by eliminating theduplicate values in the array using the following method header:public static int[] eliminateDuplicates(int[] list)Write a test program that reads in 10 integers, invokes the method, and displaysthe distinct numbers separated by exactly one space. Here is a sample run of theprogram: Enter 10 numbers: 1 2 3 2 1 6 3 4 5 2 ↵EnterThe distinct numbers are: 1 2 3 6 4 5