Using generics appropriately, write a static method which will count the number of times an element occurs in an array of objects. Your method will be tested in a program similar to the following: public class Main { public static void main(String [largs) // Create an array of Strings ... String ) names = {"abe", "babe", "strobe"}; // And an array of integers Integer () intObjs = {1, 6, 3, 6, 5, 6, 7, 8}; // Autoboxing. System.out.println(Count.count (names, "strobe")); // one "strobe", should return 1 System.out.println(Count.count (intobjs, 6)); // Three 6's, should return 3 // Note that the count method needs to use generics as it has to work for objects // In this example, it works with both Strings and Integers. Your method should be called count(), should take two parameters, the array and the item to be searched and it needs to be in a class called Count. Hint: when comparing objects, you should use the equals method. Requested files Count.java 1 / create a Count class with one static method called count which use templates and counts the number of times the item occurs in an array. 2 // The method should have two parameters, the first is the array and the second is the item to be counted.

Using generics appropriately, write a static method which will count the number of times an element occurs in an array of objects. Your method will be tested in a program similar to the following: public class Main { public static void main(String [largs) // Create an array of Strings ... String ) names = {"abe", "babe", "strobe"}; // And an array of integers Integer () intObjs = {1, 6, 3, 6, 5, 6, 7, 8}; // Autoboxing. System.out.println(Count.count (names, "strobe")); // one "strobe", should return 1 System.out.println(Count.count (intobjs, 6)); // Three 6's, should return 3 // Note that the count method needs to use generics as it has to work for objects // In this example, it works with both Strings and Integers. Your method should be called count(), should take two parameters, the array and the item to be searched and it needs to be in a class called Count. Hint: when comparing objects, you should use the equals method. Requested files Count.java 1 / create a Count class with one static method called count which use templates and counts the number of times the item occurs in an array. 2 // The method should have two parameters, the first is the array and the second is the item to be counted.

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

1. Write a program that calls a method that takes an integer array as a parameter (you can initialize an array in the main method) and find the minimum value from the list and returns it. Partial program is given below. public class Min{ public static void main(String[] args){ int arr= System.out.print(minimum(arr)); }
public static ArrayList findExactString(String s, ArrayList myArray) { return null; } // Use the above method, findExactString, as a helper method to implement addWithoutDuplication method. The addWithoutDuplication method has the following properties: 1- It takes two arguments, a string s and an ArrayList myArray of type string. 2- It returns an integer which represents the number of occurrences of the string s in myArray while attempting to add it. 3- If myArray is null, it returns -1 4- If adds the string s to the end of the ArrayList myArray if the string s is not already there. public static int addwithout Duplication(String s, ArrayList myArray) { return -1;
java Create a static method that: is called repeatAll returns ArrayList of Booleans takes in a single parameter - an ArrayList of Booleans This method should modify its ArrayList parameter by repeating its ArrayList values. For example, if the parameter is (true, false, false) The modified ArrayList should be (true, false, false, true, false, false) public static void main(String[] args) { Scanner in = new Scanner(System.in); int size = in.nextInt(); ArrayList<Boolean> list = new ArrayList<>(); for(int i=0; i < size; i++) { list.add(in.nextBoolean()); } System.out.println(repeatAll(list)); } }
java program : Assume the following method is added to the ArrayStack class. What does this method do? public ArrayStack<E> Undefined() { int j = topOfStack; ArrayStack<E> st1= new ArrayStack<E>(topOfStack + 1); for(int i = 0; i < topOfStack + 1; i++) { st1.theData[j] = theData[i]; j-- ; } return st1; } The method will return a stack containing all the elements of “this” stack in the reverse order. The method will return a stack containing the alternative elements of “this” stack in the original order. The method will return a stack containing all the elements of “this” stack in the original order. The method will return a stack containing the alternative elements of “this” stack in the reverse order.
java program : Assume the following method is added to the ArrayStack class. What does this method do? public ArrayStack<E> Undefined() { int j = topOfStack; ArrayStack<E> st1= new ArrayStack<E>(topOfStack + 1); for(int i = 0; i < topOfStack + 1; i++) { st1.theData[j] = theData[i]; j-- ; } return st1; } The method will return a stack containing all the elements of “this” stack in the reverse order. The method will return a stack containing the alternative elements of “this” stack in the original order. The method will return a stack containing all the elements of “this” stack in the original order. The method will return a stack containing the alternative elements of “this” stack in the reverse order.
Code: public class RURottenTomatoes { public static void main (String[] args) { int r = Integer.parseInt(args[0]); int c = Integer.parseInt(args[1]); for ( int i = 0; i < args.length; i++ ) { int[][] array = new int[r][c]; } String input = args[0]; int n = input.length(); String temp; int arrayR = r; int arrayC = c; for ( int i = 0; i < r; i++ ) { temp = input.substring( i, i + 1 ); arrayR = arrayR + Integer.parseInt(temp); for ( i = 0; i < c; c++ ) { temp = input.substring( i + 1, i + 2 ); arrayC = arrayC + Integer.parseInt(temp); } } } } I did all this, but then stuck. I have no idea what to do next, and I think my code is wrong. Can you help me out doing this assignment? Please explain everything that you do clearly! The instructions are below: RU Rotten Tomatoes. Write program RURottenTomatoes.java that creates a 2 dimensional integer array of movie ratings from the command line arguments and displays the index of the movie that has the highest sum of ratings.…
public class ReplaceEvenWithZero { public static void main(String[] args) { int[]a = new int[]{14, 2, 19, 3, 15, 22, 18, 7, 44, 39, 51, 78} ; // Print array a for (int i = 0; i < a.length; i++) { System.out.print(a[i] + " "); } System.out.println(); // Replace the even elements. replaceEven(a); // Print array a again to see new elements. for (int i = 0; i < a.length; i++) { System.out.print(a[i] + " "); } System.out.println(); } /** Replace the even elements in the given array with 0 @param arr the array to use for the replacements */ public static void replaceEven(int[] arr) { //-----------Start below here. To do: approximate lines of code = 2 // Write a for loop to go through each element, determine if it is even //If so, replace with 0. Hint: use the modulus operator % to determine if an…
Method Details: public static java.lang.String getArrayString(int[] array, char separator) Return a string where each array entry (except the last one) is followed by the specified separator. An empty string will be return if the array has no elements. Parameters: array - separator - Returns: stringThrows:java.lang.IllegalArgumentException - When a null array parameter is provided
public static void reverse(ArrayList<Integer> alist){}public static ArrayList<Integer> reverseList(ArrayList<Integer> alist){} How to use these two headers method and a main method to create the output of [1,2,3] [3,2,1]
Java programming language . Write a method to find the index of a value in an array of integer numbers and then test it. For example: int x = 20; int[] array = {12,5,46,20,98,75,49} => The output -> the index is = 3
Project Description: In this project you implement an ArrayStack ADT and use the stack for implementing the following methods: a) Reverse an array of Words: Accept an array of words as input parameter and return an array of words in reverse order. Use the method signature: public static String[] reverseWords (String[] wordList) Example Input: Bird Cat Dog Elephant Output: Elephant Dog Cat Bird
public class FindArrayDifference { static void arrayDifference(int a[], int b[]) { int k = 0; int [] c = new int[a.length]; for(int i=0; i < a.length; i++) { int j; for(j = 0; j < b.length; j++) if(a[i] == b[j]) break; if(j == b.length) c[k++] = a[i]; } for(int j = 0; j < k; j++) System.out.println(c[j]); } public static void main(String[] args) { int a[] = {1,2,3,7,8,15,26}; int b[] = {1,2,3,15,4,8,6}; arrayDifference(a,b); } } Calculate the algorithm step number and algorithm time complexity of the above program?