Program to ComparableCircle class Program Plan: Include a class name named “Exercise_13_06”. Declare the main() method. Create two instances of ComparableCircle objects by referencing the ComparableCircle class. Display comparableCircle1 and ComaprableCircle2 objects. Find and display the larger of the two ComparableCircle objects by using the compareTo() method in GeometricObject class. Close the main() method. Close the class. Include an abstract class “GeometricObject”. Declare all the data types of the variables. Construct a default geometric object. Construct a geometric object with color and filled value. Assign color and fill to the object. Set a new color. Define an isFilled method returns filled and since filled is Boolean; the get method is named isFilled. Set a new filled and getDateCreated method. Override toString function to return output. Define Abstract method getArea. Define Abstract method getPerimeter. Close class. Include a class “ComparableCircle”. Construct a ComparableCircle method with specified radius. Construct a ComparableCircle method with specified properties. Construct an override function to implement the compareTo method defined in Comparable. Construct an override function to implement the toString method defined in Circle class. Close class. Include a class “Circle” that extends the class GeometricObject class. Declare radius variable. Create a Circle constructor. Assign values to radius. Create a function to set color and set fill in the Circle. Create a Function to return radius. Create a function to set a new radius. Create an override function to return area. Create an override function to return perimeter. Create an override string description of circle object. Close class.

Question

Want to see the full answer?

Answer 1

Question

Chapter 13, Problem 13.6PE

Program Plan Intro

Program to ComparableCircle class

Program Plan:

Include a class name named “Exercise_13_06”.

Declare the main() method.

Create two instances of ComparableCircle objects by referencing the ComparableCircle class.

Display comparableCircle1 and ComaprableCircle2 objects.

Find and display the larger of the two ComparableCircle objects by using the compareTo() method in GeometricObject class.

Close the main() method.

Close the class.

Include an abstract class “GeometricObject”.

Declare all the data types of the variables.

Construct a default geometric object.

Construct a geometric object with color and filled value.

Assign color and fill to the object.

Set a new color.

Define an isFilled method returns filled and since filled is Boolean; the get method is named isFilled.

Set a new filled and getDateCreated method.

Override toString function to return output.

Define Abstract method getArea.

Define Abstract method getPerimeter.

Close class.

Include a class “ComparableCircle”.

Construct a ComparableCircle method with specified radius.

Construct a ComparableCircle method with specified properties.

Construct an override function to implement the compareTo method defined in Comparable.

Construct an override function to implement the toString method defined in Circle class.

Close class.

Include a class “Circle” that extends the class GeometricObject class.

Declare radius variable.

Create a Circle constructor.

Assign values to radius.

Create a function to set color and set fill in the Circle.

Create a Function to return radius.

Create a function to set a new radius.

Create an override function to return area.

Create an override function to return perimeter.

Create an override string description of circle object.

Close class.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Dijkstra's Algorithm (part 1). Consider the network shown below, and Dijkstra’s link-state algorithm. Here, we are interested in computing the least cost path from node E (note: the start node here is E) to all other nodes using Dijkstra's algorithm. Using the algorithm statement used in the textbook and its visual representation, complete the "Step 0" row in the table below showing the link state algorithm’s execution by matching the table entries (i), (ii), (iii), and (iv) with their values. Write down your final [correct] answer, as you‘ll need it for the next question.

4. |z + 5 - 5i| = 7

14. dz, C: |z❘ C: |z❘ = 0.6 ze² - 2iz H