Pair of minimum and maximum Program plan: Filename: “Coin.java” This code snippet creates a class “Coin”. In the code, Import the required packages. Define a class “Coin”. Declare the class member “value”. Declare the class member “name”. Declare the constructor “Coin()”. Set the values of class members. Define the method “getValue()”. Return “value”. Define the method “getMeasure()”. Return “value”. Define the method “getName()”. Return “name”. Define the method “toString()”. Return the value of “value” and “name”. Filename: “Measurable.java” This code snippet creates an interface “Measurable”. In the code, Define an interface “Measurable”. Declare the method “getMeasure()”. Filename: “Pair.java” This code snippet creates a class “Pair”. In the code, Define a class “Pair”. Declare the class members “first” and “second”. Define the constructor “Pair()”. Set the class members. Define the getter “getFirst()”. Return the value of “first”. Define the getter “getSecond()”. Return the value of “second”. Filename: “PairUtil.java” This code snippet creates a class “PairUtil”. In the code, Define a class “PairUtil”. Define the method “minmax()”. If the length of “a” equal to “0”, Return “null”. Declare a variable “min” of type “E” and set “a[0]” to it. Declare a variable “max” of type “E” and set “a[0]” to it. Iterate a “for” loop, If the value of “element” is less than “min”, Set “min” equal to “element”. If the value of “element” is greater than “max”, Set the value of “max” equal to “element”. Return the pair of “min” and “max”. Filename: “MinMaxTester.java” This code snippet creates a class “MinMaxTester”. In the code, Define a class “MinMaxTester”. Define the “main” method. Define an array “coins” of type “Coin” and add elements to array list “coins” by calling the method “add()” Define a pair “mm”. Call the method “getFirst()” and print the result on the screen. Print the expected result. Call the method “getSecond()” and print the result on the screen. Print the expected result.

Question

Want to see the full answer?

Answer 1

Question

Chapter 18, Problem 1PP

Program Plan Intro

Pair of minimum and maximum

Program plan:

Filename: “Coin.java”

This code snippet creates a class “Coin”. In the code,

Import the required packages.

Define a class “Coin”.

Declare the class member “value”.

Declare the class member “name”.

Declare the constructor “Coin()”.

Set the values of class members.

Define the method “getValue()”.

Return “value”.

Define the method “getMeasure()”.

Return “value”.

Define the method “getName()”.

Return “name”.

Define the method “toString()”.

Return the value of “value” and “name”.

Filename: “Measurable.java”

This code snippet creates an interface “Measurable”. In the code,

Define an interface “Measurable”.

Declare the method “getMeasure()”.

Filename: “Pair.java”

This code snippet creates a class “Pair”. In the code,

Define a class “Pair”.

Declare the class members “first” and “second”.

Define the constructor “Pair()”.

Set the class members.

Define the getter “getFirst()”.

Return the value of “first”.

Define the getter “getSecond()”.

Return the value of “second”.

Filename: “PairUtil.java”

This code snippet creates a class “PairUtil”. In the code,

Define a class “PairUtil”.

Define the method “minmax()”.

If the length of “a” equal to “0”,

Return “null”.

Declare a variable “min” of type “E” and set “a[0]” to it.

Declare a variable “max” of type “E” and set “a[0]” to it.

Iterate a “for” loop,

If the value of “element” is less than “min”,

Set “min” equal to “element”.

If the value of “element” is greater than “max”,

Set the value of “max” equal to “element”.

Return the pair of “min” and “max”.

Filename: “MinMaxTester.java”

This code snippet creates a class “MinMaxTester”. In the code,

Define a class “MinMaxTester”.

Define the “main” method.

Define an array “coins” of type “Coin” and add elements to array list “coins” by calling the method “add()”

Define a pair “mm”.

Call the method “getFirst()” and print the result on the screen.

Print the expected result.

Call the method “getSecond()” and print the result on the screen.

Print the expected result.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Please run the following program and answer the questions. #include int main(void) { int arr[6] = int *pointer pointer *pointer = {10, 20, 30, 40, 50, 60}; = &arr[0]; pointer + 2; = 5 ; pointer++; *pointer - (*pointer) 5 ; pointer++; *pointer * (pointer+1) - 5%; return 0; 1. [10 pts] Please list the values of elements in array arr after line 8 (*pointer why. = 5; ) and explain

> Comparable Method - methodName: String -priority: int + Method() + Method(methodName: String, priority: int) + abstract specificWay(): void + Getters and setters for all fields compareTo(otherMethod: Method): int + toString(): String ReadMethod - language: String + ReadMethod() + ReadMethod(methodName: String, priority: int, language: String) + specificWay(): void + Getters and setters for language + toString(): String Part 1.1. Implement the abstract class Method implements Comparable interface according to its UML diagram. Add comments stating where data fields, constructors, toString(), and other methods are (if any). Neither method should have an empty body unless abstract methods. 1. two constructors (default and the constructor with all fields) 2. getters and setters for all fields (methodName and priority). 3. toString() method: modify by yourself to match the example output. 4. Abstract method void specificWay(). 5. Implement compara To(Method otherMethod) to compare…

Exercise 1 Function and Structure [30 pts] Please debug the following program and answer the following questions. There is a cycle in a linked list if some node in the list can be reached again by continuously following the next pointer. #include typedef struct node { int value; struct node *next; } node; int ll_has_cycle (node *first) if (first NULL) return 0; node *head = first%;B while (head->next != NULL) { } if (head first) { return 1; } head = head->next;B return 0; void test_11_has_cycle() { int i; node nodes [6] ; for (i = 0; i < 6; i++) { nodes [i] .next = NULL; nodes [i].value i; nodes [0] .next = &nodes [1]; nodes [1] .next = &nodes [2]; nodes [2] .next &nodes [3]; nodes [3] .next nodes [4] .next & nodes [4]; NULL; nodes [5] .next &nodes [0]; printf("1. Checking first list for cycles. \n Function 11_has_cycle says it has %s cycle\n\n", 11_has_cycle (&nodes[0])?"a":"no"); printf("2. Checking length-zero list for cycles. \n Function 11_has_cycle says it has %s cycle\n\n",…