Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)
Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)
4th Edition
ISBN: 9780134787961
Author: Tony Gaddis, Godfrey Muganda
Publisher: PEARSON
bartleby

Concept explainers

Question
Book Icon
Chapter 17, Problem 6PC
Program Plan Intro

Generic class

Program plan:

  • Import the required package.
  • Create the class “MyList” with a type parameter “T” that accepts any type that implements “Comparable” interface.
    • Create “ArrayList” as a field of class “MyList” with type parameter “T”.
    • Define the constructor.
    • Define the public method “add()” to accept the parameter of type “T”,
      • Store the value in “ArrayList” using the reference variable “list”.
    • Define the method “largest()”,
      • Call the method “get()” to store the initial value of “ArrayList” in the variable “val”.
      • Iterate the elements of “ArrayList” using “for” loop.
      • Use standard method “compareTo()” for standard comparison to find largest value..
      • Return the largest value using the keyword “return”.
    • Define the method “smallest()”,
      • Call the method “get()” to store the initial value of “ArrayList” in the variable “val”.
      • Iterate using “for” loop to find the smallest value in the “ArrayList”.
      • Use standard method “compareTo()” for standard comparison to find smallest value.
      • Return the smallest value using the keyword “return”.
  • Create the class “Main”,
    • Define the method “main()”,
      • Create the object of a class “MyList” as a type of “Integer”.
      • Call the “add()” method using the object of type “Integer” to fill the values in the “ArrayList” of “Integer”.
      • Call the method “largest()” to print the largest value of Integer “ArrayList”.
      • Call the method “smallest()” to print the smallest value of Integer “ArrayList”.

Blurred answer
Students have asked these similar questions
Excercise: Listed next is the skeleton for a class named City. Each city has a name and temperature: public class City { private String cityName; private int temperature; } Flesh out the class with appropriate accessors, constructors, and mutators. Next, modify the class so that it implements the Comparable interface. The order between instances of the City class depends on the temperature. Test your class by creating an array of sample cities and sort them in an ascending order using Arrays.sort   Notes: The language used for this question is Java. So far, this is the City class after fleshing it out: public class City implements Comparable<City> {private String cityName;private double temperature; public City() {} public City(String cityName, double temperature) {this.cityName = cityName;this.temperature = temperature;} public String getCityName() {return cityName;} public double getTemperature() {return temperature;} public void setName(String cityName)…
1. Write a generic method named array_prod() that takes an array of a generic type are returns the product of the values in the elements in the array. Make sure that the generic type extends the Number class. The Number class is defined in the java.lang package.   2. Complete the main() method to find the products of the elements in the provided arrays. Print the results in the main method using 3 decimals.
C#   (Generic Method IsEqualTo) Write a simple generic version of method IsEqualTo that compares its two arguments with the Equals method, and returns true if they’re equal and false otherwise. Use this generic method in a program that calls IsEqualTo with a variety of simple types, such as object or int. What result do you get when you attempt to run this program?

Chapter 17 Solutions

Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)

Ch. 17.3 - Prob. 17.11CPCh. 17.3 - Prob. 17.12CPCh. 17.3 - Prob. 17.13CPCh. 17.3 - Prob. 17.14CPCh. 17.4 - Prob. 17.15CPCh. 17.5 - Prob. 17.16CPCh. 17.5 - Prob. 17.17CPCh. 17.6 - Prob. 17.18CPCh. 17.6 - Prob. 17.19CPCh. 17.6 - Prob. 17.20CPCh. 17.8 - Prob. 17.21CPCh. 17.8 - Prob. 17.22CPCh. 17.9 - Prob. 17.23CPCh. 17.9 - During the process of erasure, when the compiler...Ch. 17.9 - Prob. 17.25CPCh. 17 - Prob. 1MCCh. 17 - Prob. 2MCCh. 17 - Look at the following method header: void...Ch. 17 - Look at the following method header: void...Ch. 17 - Look at the following method header: void...Ch. 17 - Look at the following method header: void...Ch. 17 - Prob. 7MCCh. 17 - Prob. 8MCCh. 17 - Prob. 9MCCh. 17 - The process used by the Java compiler to remove...Ch. 17 - True or False: It is better to discover an error...Ch. 17 - Prob. 12TFCh. 17 - True or False: Type parameters must be single...Ch. 17 - Prob. 14TFCh. 17 - Prob. 15TFCh. 17 - True or False: You cannot create an array of...Ch. 17 - Prob. 17TFCh. 17 - Prob. 18TFCh. 17 - Prob. 1FTECh. 17 - Assume the following is a method header in a...Ch. 17 - public class MyClassT { public static void...Ch. 17 - public class PointT extends Number super Integer {...Ch. 17 - Assume there is a class named Customer. Write a...Ch. 17 - Assume names references an object of the...Ch. 17 - Prob. 3AWCh. 17 - Prob. 4AWCh. 17 - Prob. 5AWCh. 17 - Prob. 6AWCh. 17 - Prob. 7AWCh. 17 - Prob. 1SACh. 17 - Look at the following method header: public T...Ch. 17 - Prob. 3SACh. 17 - Do generic types exist at the bytecode level?Ch. 17 - Prob. 5SACh. 17 - When the compiler encounters a class, interface,...Ch. 17 - Prob. 1PCCh. 17 - Prob. 2PCCh. 17 - Prob. 3PCCh. 17 - Prob. 4PCCh. 17 - Prob. 5PCCh. 17 - Prob. 6PCCh. 17 - Prob. 7PC
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning