MyList class Program plan: Import the required package. Create the class “MyList” with a type parameter “T” that is constrained to an upper bound Number using the keyword extends, Create “ArrayList” as a field of class “MyList” with type parameter “T”. 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. Iterate the elements of “ArrayList” using “for” loop and compare each value using if statement to find the largest value in the “ArrayList”. 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. Iterate the elements of “ArrayList” using “for” loop and compare each value using if statement to find the smallest value in the “ArrayList”. 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 to fill the values in the “ArrayList”. Call the method “largest()” to print the largest value of “ArrayList”. Call the method “smallest()” to print the smallest value of “ArrayList”.

Question

Want to see the full answer?

Answer 1

Question

Chapter 17, Problem 1PC

Program Plan Intro

MyList class

Program plan:

Import the required package.

Create the class “MyList” with a type parameter “T” that is constrained to an upper bound Number using the keyword extends,

Create “ArrayList” as a field of class “MyList” with type parameter “T”.

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.

Iterate the elements of “ArrayList” using “for” loop and compare each value using if statement to find the largest value in the “ArrayList”.

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.

Iterate the elements of “ArrayList” using “for” loop and compare each value using if statement to find the smallest value in the “ArrayList”.

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 to fill the values in the “ArrayList”.

Call the method “largest()” to print the largest value of “ArrayList”.

Call the method “smallest()” to print the smallest value of “ArrayList”.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

We are considering the RSA encryption scheme. The involved numbers are small, so the communication is insecure. Alice's public key (n,public_key) is (247,7). A code breaker manages to factories 247 = 13 x 19 Determine Alice's secret key. To solve the problem, you need not use the extended Euclid algorithm, but you may assume that her private key is one of the following numbers 31,35,55,59,77,89.

Consider the following Turing Machine (TM). Does the TM halt if it begins on the empty tape? If it halts, after how many steps? Does the TM halt if it begins on a tape that contains a single letter A followed by blanks? Justify your answer.

Pllleasassseee ssiiirrrr soolveee thissssss questionnnnnnn