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.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

Write a JAVA program to define a generic method that counts the number of elements in an array T[] that are greater than a specified element elem.
Write a Java method that will take in a generic ArrayList with Doubles (reference type). Have the method take each Double and convert it to an Integer and store it into another generic ArrayList that holds Integers. When done, return the new Integer ArrayList.
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.
Your activity: write a same java program that will accept 20 integer in a list and returns the index of the first occurrence of the smallest element in the array. Also, write a program to test your method. Write a Java method, smallestIndex, that takes as its parameters an int array and its size, and returns the index of the (first occurrence of the) smallest element in the array. public class Array_labExercise2 { public static void main(String[] args) { int[] list = {56, 34, 67, 54, 23, 87, 66, 92, 15, 32, 55, 15, 88, 22, 30}; System.out.print("List elements: "); printArray(list); System.out.println(); System.out.println("Index of the (first occurenc of the) " + "smallest element in list is: " + smallestIndex(list)); System.out.println("Smallest element in list is: " + list[smallestIndex(list)]); } public static void printArray(int[] list) { int counter; for (counter = 0; counter < list.length; counter++) System.out.print(list[counter] + " ");…
Write a Program in Java programming: Support you have an ArrayList containing random integers. These integers can be any number, and each integer can appear more than once. For example, [2, 19, 21, 19, 21, 1, 3, 3, 6, 21, .....] Your job is to write a method called findEvenFrequentNumbers(ArrayList<Integer> list) that returns an ArrayList which has all the numbers appears in even frequency and in increasing order. e.g. list = [2, 19, 21, 19, 21, 1, 3, 3, 6, 21], should return [3, 19] list = [3, 3, 3, 1, 2, 2, 2, 2, 2], should return [] list = [1, 1, 1, 1, 1], should return [1] Note that you need to provide a class with the main function and also the imports.
in Java Implement a method public static double[] add(double[] a, double[] b) for the component-wise sum of vectors: given vectors (a1, a2, . . . , an) and (b1, b2, . . . , bn) of the same length, the sum is the vector (a1 + b1, a2 + b2, . . . , an + bn). For example, the result of applying add to (0, 3, −1) and (2, −5, 1) should be (0 + 2, 3 + (−5), −1 + 1) = (2, −2, 0). Important: add should NOT change the given arrays and should return a new array instead.
To help manage the wizarding world, we need to write a reverse method. For the general purpose, let us write a generic reverse method. Namely, given an array of T objects, the reverse method would use a stack to reverse these T objects and return a new ArrayList with these T objects in reverse order. The generic method prototype is as follows: public <T> ArrayList<T> reverse(T[] wizards) throws Exception; To help reverse Hogwarts students' names, we can invoke the method as follows: reverse({"Harry Potter", "Ronald Bilius", "Hermione Jean Granger"}) , where {"Harry Potter", "Ronald Bilius", "Hermione Jean Granger"} is an array input and it will return an java.util.ArrayList instance, containing "Hermione Jean Granger" as the first element, "Ronald Bilius" as the second element, and "Harry Potter" as the third element. Task 1. Please use a Stack to implement the generic reverse method: public ArrayList reverse(T[] wizards) throws Exception First write…
FOR JAVA Write a method that takes a one dimensional integer array, an integer (as index) and another integer (as number). Your program must insert the number into the given index, shift the rest of the elements to the right, and return the new array. For instance, if we want to insert the number 0 into position 3 of {1, 2, 3, 4, 5}, your method must return {1, 2, 3, 0, 4, 5}.
Computer Science ** In JAVA** What would a generic radix sorter look like that computed the same function on Strings as my EXAMPLE (below), that checks true, or throw an exception….? EXAMPLE: StringComparator.java import java.util.Comparator; public class StringComparator implements Comparator { @Override public int compare(String s1, String s2) { return s1.toLowerCase().compareTo(s2.toLowerCase()); } } HeapSort.java import java.util.ArrayList; import java.util.Comparator; public class HeapSort { public void sortingHeapTree(ArrayList arr, Comparator c) { int n = arr.size(); for (int i = n / 2 - 1; i >= 0; i--) HeapTreeConstruction(arr, n, i, c); for (int i = n - 1; i >= 0; i--) { T temp = arr.get(0); arr.set(0, arr.get(i)); arr.set(i, temp); HeapTreeConstruction(arr, i, 0, c); } } void HeapTreeConstruction(ArrayList arr, int n, int i, Comparator c) { int root = i; // Initialize largest as root int l = 2 * i + 1; // left = 2*i + 1 int r = 2 * i + 2; // right = 2*i + 2 if…
Write a Java program using generic method reverseArray that reverses the order of elements in an array of different types. Print each array before and after calling reverseArray method
The split method in the String class returns an array of strings consisting of the substrings split by the delimiters. However, the delimiters are not returned. Implement the following new method that returns an array of strings consisting of the substrings split by the matching delimiters, including the matching delimiters. public static String[] split(String s, String regex) For example, split("ab#12#453", "#") returns ab, #, 12, #, and 453 in an array of String and split("a?b?gf#e", "[?#]") returns a, ?, b, ?, gf, #, and e in an array of String.
Java: Write a method/programme that will take a generic linked list and make a palindrome of the list. In a seperate test programme the user can add any elements to the generic list and then this list must be made a palindrome. The output should be the original list with the palindrome list added to this list.