Make the following class generic so that it can deal with an arbitrary class rather than only String instances. public class Group { private ArrayList< String > group = new ArrayList<>(); public String get() { return group.remove(0); } public void insert( String value) { group.add(value); } }

Make the following class generic so that it can deal with an arbitrary class rather than only String instances. public class Group { private ArrayList< String > group = new ArrayList<>(); public String get() { return group.remove(0); } public void insert( String value) { group.add(value); } }

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

Consider the following class PrimeNumbers, which has three methods. The first, computePrimes() takes one integer input and calculates that many prime numbers. Iterator() returns an Iterator object that will iterate through the primes, and toString() returns a string representation. public class PrimeNumbers implements Iterable<Integer> { private List<Integer> primes = new ArrayList<Integer>(); public void computePrimes (int n) { int count = 1; // count of primes int number = 2; // number tested for primeness boolean isPrime; // is this number a prime while (count <= n) { isPrime = true; for (int divisor = 2; divisor <= number / 2; divisor++) { if (number % divisor == 0) { isPrime = false; break; // for loop } } if (isPrime && (number % 10 != 9)) // FAULT { primes.add (number); count++; } number++; } } @Override public Iterator<Integer> iterator() { return primes.iterator(); } 2 @Override public String toString() { return primes.toString();…
Add unit testing to the textanalyzer class. Please perform this task using JUnit. import java.util.ArrayList; import java.util.Collections; import java.util.Comparator; import java.util.HashMap; import java.util.List; import java.util.Map; import java.util.Set; import java.io.*; public class TextAnalyzer { public static void main(String[] args) throws Exception { String Word; URL poem = new URL("https://www.gutenberg.org/files/1065/1065-h/1065-h.htm"); BufferedReader in = new BufferedReader( new InputStreamReader(poem.openStream())); Map map = new HashMap(); while ((Word = in.readLine()) != null) { String[] words = Word.split("[\\s.;,?:!()\"]+"); for (String word : words) { word = word.trim(); if (word.length() > 0) { if (map.containsKey(word)) { map.put(word, map.get(word) + 1); } else { map.put(word, (int) 1L); } } } } // retrieving the map contents Set> set = map.entrySet(); // make an array list List> sortedList = new…
Consider the instance variables and constructors. Given Instance Variables and Constructors: public class SimpleLinkedList<E> implements SimpleList<E>, Iterable<E>, Serializable { // First Node of the List private Node<E> first; // Last Node of the List private Node<E> last; // Number of List Elements private int count; // Total Number of Modifications (Add and Remove Calls) private int modCount; /** * Creates an empty SimpleLinkedList. */ publicSimpleLinkedList(){ first = null; last = null; count = 0; modCount = 0; } ... Assume the class contains the following methods that work correctly: public boolean isEmpty() public int size() public boolean add(E e) public E get(int index) private void validateIndex(int index, int end) Complete the following methods based on the given information from above. /** * Adds an element to the list at the…
Add a void instance method replaceAll(E oldE, E newE) in the MyLinkedList class to replace the occurrence of all oldE value with the specified newE value. Implement this method in O(n) time. import java.util.*; public class PExamCh24 { public static void main(String[] args) { new PExamCh24();}public PExamCh24() { // Create a list for strings MyLinkedList<String> list = new MyLinkedList<>(); // Add elements to the list list.add("America"); // Add America to the list System.out.println("(1) " + list); list.add(0, "Japan"); // Add Canada to the beginning of the list System.out.println("(2) " + list); list.add("Russia"); // Add Russia to the end of the list System.out.println("(3) " + list); list.addLast("Japan"); // Add France to the end of the list System.out.println("(4) " + list); list.add(2, "Japan"); // Add Germany to the list at index 2 System.out.println("(5) " + list); list.add(5, "Norway"); // Add Norway to the list…
Java 1. Implement ArrayUnorderedList<T> class which will extend ArrayList<T> by defining the following additional methods(i) public void addToFront(T element); //Adds the specified element to the front of the list.(ii) public void addToRear(T element); //Adds the specified element to the rear of the list.(iii) public void addAfter(T element, T target); //Adds the specified element after the specified target element.a. Create an object of ArrayUnorderedList<T> class and perform some add, remove, and search operations and finally print the entire Stack.
create a class called Dwarf that has a name (String) and a height (int). In addition, when Dwarfs are placed in a LinkedList and sorted, they will be sorted from tallest to shortest. import java.util.*; public class Main{ public static void main(String[] args) { ArrayList<Dwarf> l = new ArrayList<Dwarf>(); l.add(new Dwarf("Sleepy", 14)); l.add(new Dwarf("Dopey", 17)); l.add(new Dwarf("Doc", 9)); l.add(new Dwarf("Happy", 22)); l.add(new Dwarf("Sneezy", 29)); l.add(new Dwarf("Bashful", 11)); l.add(new Dwarf("Grumpy", 4)); Collections.sort(l); for (Dwarf d : l) System.out.println(d.getName()); }} output Sneezy Happy Dopey Sleepy Bashful Doc Grumpy
Write a class TouristSpot that has the data members; name of tourist spot, state in which it lies. Create an array list of n places and write a function that takes array list as an argument to identify a state that has more than one tourist spot. Java Program
How do I create a class called MyArrayList which acts just like Java's ArrayList class? And how do I implement an interface exactly like Java's List interface, and for your class to the two constructors given below? You are given the MyListInterface: abstract class MyListInterface extends java.util.AbstractList { abstract public int size (); abstract public void clear (); abstract public boolean add (final Integer element); abstract public Integer get (final int index); abstract public Integer set (final int index, final Integer element); abstract public Integer remove (final int index); abstract public boolean remove (final Integer element); abstract public String toString(); } How do I create an array of type Integer[] with some initial size and keep track of the number of elements actually in use in the array? When it reach the size limit of the array, it must grow the array by creating a new array and copy elements from old array. Here is a list of the…
Implement a class CountingArrayList that extends ArrayList<String> and that counts the number of calls to get and set. import java.util.ArrayList;import java.util.Collections; public class CountingArrayListTester{ public static String smallest(ArrayList<String> values) { String smallestSoFar = values.get(0); for (int i = 1; i < values.size(); i++) { String value = values.get(i); if (value.compareTo(smallestSoFar) < 0) { smallestSoFar = value; } } return smallestSoFar; } public static void main(String[] args) { CountingArrayList words = new CountingArrayList(); words.add("Mary"); words.add("had"); words.add("a"); words.add("little"); words.add("lamb"); words.add("its"); words.add("fleece"); words.add("was"); words.add("white"); words.add("as"); words.add("snow"); String smallest = smallest(words);…
Import the ArrayList and List classes from the java.util package to create a list of phone numbers and also import the HashSet and Set classes from the java.util package to create a set of unique prefixes. Create a class called PhoneNumberPrefix with a main method that will contain the code to find the unique prefixes. Create a List called phoneNumbers and use the add method to add several phone numbers to the list. List<String> phoneNumbers = new ArrayList<>(); phoneNumbers.add("555-555-1234"); phoneNumbers.add("555-555-2345"); phoneNumbers.add("555-555-3456"); phoneNumbers.add("444-444-1234"); phoneNumbers.add("333-333-1234"); Create a Set called prefixes and use a for-each loop to iterate over the phoneNumbers list. For each phone number, we use the substring method to extract the first 7 characters, which represent the prefix, and add it to the prefixes set using the add method. Finally, use the println method to print the prefixes set, which will contain all of…
2. The class PetShop has a single field as defined below: private ArrayList petList; Define a method to print out the details of all cats in petList in PetShop.
Modify the generic Pair.java class in two ways: Make it so that both values have the same type Add a method swap that swaps the first and second elements of the pair Examples:Pair<Integer> intPair = new Pair<>(17, 19);intPair.getFirst(); // returns 17intPair.getSecond(); // returns 19intPair.swap();intPair.getFirst(); // returns 19intPair.getSecond(); // returns 17Pair<String> strPair = new Pair<>("Erick", "Valdez");strPair.getFirst(); // returns "Erick"strPair.getSecond(); // returns "Valdez"strPair.swap();strPair.getFirst(); // returns "Valdez"strPair.getSecond(); // returns "Erick" Pair.java /*** This class collects a pair of elements of different types.*/public class Pair<T, S> {private T first;private S second;/*** Constructs a pair containing two given elements.* * @param firstElement the first element* @param secondElement the second element*/public Pair(T firstElement, S secondElement) {first = firstElement;second = secondElement;}/*** Gets…