Write a static method named vowelCount that accepts a String as a parameter and returns an array of integers representing the counts of each vowel in the String. The array returned by your method should hold 5 elements: the first is the count of As, the second is the count of Es, the third Is, the fourth Os, and the fifth Us. Assume that the string contains no uppercase letters. For example, the call vowelCount("i think, therefore i am") should return the array {1, 3, 3, 1, 0}. Type your solution here: 8. 9 10 11 12 13 14 15 16 17 18 This is a method problem. Write a Java method as described. Do not write a complete program or class; just the method(s) above. 2 Indent

Write a static method named vowelCount that accepts a String as a parameter and returns an array of integers representing the counts of each vowel in the String. The array returned by your method should hold 5 elements: the first is the count of As, the second is the count of Es, the third Is, the fourth Os, and the fifth Us. Assume that the string contains no uppercase letters. For example, the call vowelCount("i think, therefore i am") should return the array {1, 3, 3, 1, 0}. Type your solution here: 8. 9 10 11 12 13 14 15 16 17 18 This is a method problem. Write a Java method as described. Do not write a complete program or class; just the method(s) above. 2 Indent

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 (define) a public static method named countGreaterThan, that takes an array of int, and an int as arguments and returns (as an int) a count of the number of values in the argument array that are greater than the second argument value. For example, given the following Array declaration and instantiation: int[] myArray = {1, 22, 333, 400, 5005, 9}; countGreaterThan(myArray, 200) should return 3 countGreaterThan(myArray, 9999) should return 0 You may wish to write some additional code to test your method. ------------------------------------------- public class Main { public static void main(String[] args) { // you may wish to write some code in this main method // to test your method. } // define your method(s) here below }
java Write a method that takes rows and columns as a parameter, and returns a 2D array of the designated size, filled with empty Strings. I currently have public static String[][] createArray(int row, int col) { String[][]arr=new String[row][col]; return arr; } but it returns the 2d array filled with null?
Write a method called kthLargest() that accepts an integer x and an array a of integers as its parameters. It should then return the elements that that k elements of greater or equal value. So if k = 0 return the largest element. If k = 1. return the second-largest element, and so on. Do not change the array itself, but you can make a copy if you want. Suggested approach make a COPY of the array. Sort the copy then find the kth element of the copy and return it. The original is left untouched! :) For example if array1 = {74, 85, 102, 99, 101, 56, 84} and the function kthLargest(2, array1) is called, then your method should return 99 because there are two values that are larger than 99. (101 and 102). If x is less than zero or greater than/equal to the the size of the array then return -9999; Make sure your main function works for the following public static void main(String[] args){int[] array1 = {6, 8, 2, 3, 5, 12, 16, 1, 7, 4, 21, 19};int answer =…
Write a method called largestRow that take a two-dimension array of integers as a parameter and returns the number of the row that has the largest length. For example, if the array (as created by the program below) is 10 45 3 8 2 42 3 21 44 The value returned would be zero (row zero has the largest length).
Write a public static method named printArray, that takes two arguments. The first argument is an Array of int and the second argument is a String. The method should print out a list of the values in the array, each separated by the value of the second argument. For example, given the following Array declaration and instantiation: int[] myArray = {1, 22, 333, 400, 5005, 9}; printArray(myArray, ", ") will print out 1, 22, 333, 400, 5005, 9printArray(myArray, " - ") will print out 1 - 22 - 333 - 400 - 5005 - 9 You may wish to write some additional code to test your method. -------------------------------------------------- // import any necessary packages here below public class Main { public static void main(String[] args) { // write any code to test you method(s) here below } // define your method(s) here below }
Write a static method called "removeDuplicates" that takes an ArrayList of Strings as a parameter. It should first sort the ArrayList using the sort function of the Containers helper class and then remove any duplicates so that only one of any series of duplicates remains in the ArrayList. For example, suppose that the parameter is an ArrayList named a containing: ["clam", "squid", "squid", "squid", "clam", "octopus", "octopus", "shrimp"] Then after calling “removeDuplicates(list)” the ArrayList a should contain: ["clam", "octopus", "shrimp", "squid"] Please note: quotation marks would not appear in the actual output of the ArrayList, they are only included here for clarity. The actual ArrayList output would be: [clam, octopus, shrimp, squid] You may use the following code to test your program: Expected output is listed to the right of the print statement. import java.util.*;public class RemoveDuplicates { public static void main(String[] args) {…
Write a Java program, called LinearSearch2, that contains a static method called countStrings() that accepts a 2D array of Strings and a String as its parameters. The method should return an integer value that is the total number of times the String being searched for is contained in the 2D String array. In the main method you should use user input to take the element you wish to search for in the array. There is code there for your array, DO NOT CHANGE THIS CODE. You should print an appropriate message to the screen if the element is found and how many times it exists in the array. Note: The countStrings() method should work irrespective of case. Sample Input 1 Duck Sample Array 1 cat dog dUck rabbit hen duCk dUcK DucK goose Sample Output 1 Duck is contained 4 times in the array Sample Input 2 Opel Sample Array 2 Volvo Fiat Suzuki Toyota fiat Suzuki Volvo Ferrari Ferrari Porsche Lamborghini Jag Jag Fiat Citroen Toyota Sample Output 2 Opel was NOT found in the array
Write a method that accepts an array of integers as a parameter and returns a reference to an array that contains the even numbers in the original array. The returned array should have a size equal to the number of even numbers in the original array. Use Java 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
Write a method, given a String array, will return a new copy of the array but with all of its elements in lower case. (Use Java) (Hint: You can use the method toLowerCase()) For example, if the method receives the following String array: {"stone", "Bronze", "IRON", "Industrial", "INFOrmation"} It should return a new String array with the following values: {"stone", "bronze", "iron", "industrial", "information"}
Write a static method called printAll in a class called ArrayTools. Make this method print all the elements in the String array. Return the size of that array. Test Case 1 [0]: curzon\n[1]: ensphering\n[2]: baasskap\n[3]: unswiveling\n[4]: preminence\n[5]: stanchion\n[6]: meteoritic\n[7]: bitternut\n[8]: cobb\n[9]: autogenous\nThat was 10 words.\n[0]: rahab\n[1]: disendow\n[2]: overoptimistically\n[3]: eggnog\n[4]: vitrifying\n[5]: stover\nThat was 6 words.\n