in Java Part 1 : Start by creating a new class called MyPoint that can be initialized with either of these constructors: MyPoint p1 = new MyPoint(); MyPoint p2 = new MyPoint(2.0, 4.0); The two arguments given to the constructor are x (2.0) and y (4.0) co-ordinates. Don’t forget to include getters and setters as these should be private instance variables!   Part 2 : Create a toString() instance method that prints out the co-ordinates of the point. Add two instance methods that return the Euclidean distance to another point, or to another (x, y) coordinate. Example: double distance = p2.distance(p1); The Euclidean distance between two points is: d=√x^2 + y^2 You will need to make use of methods from the Math package: https://docs.oracle.com/en/java/javase/17/docs/api/java.base/java/lang/Math.html Test your constructors and the new methods. Part 3 : Create a class method, contains(MyPoint[] points, MyPoint p), that checks if the point p is in the array points and returns a boolean.   Finally, add a class method horizontal(MyPoint[] points) that determines if an array of points is in a horizontal line and returns a boolean.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

in Java

Part 1 : Start by creating a new class called MyPoint that can be initialized with either of these constructors:

MyPoint p1 = new MyPoint();

MyPoint p2 = new MyPoint(2.0, 4.0);

The two arguments given to the constructor are x (2.0) and y (4.0) co-ordinates. Don’t forget to include getters and setters as these should be private instance variables!

 

Part 2 :

Create a toString() instance method that prints out the co-ordinates of the point. Add two instance methods that return the Euclidean distance to another point, or to another (x, y) coordinate. Example:

double distance = p2.distance(p1);

The Euclidean distance between two points is: d=√x^2 + y^2

You will need to make use of methods from the Math package: https://docs.oracle.com/en/java/javase/17/docs/api/java.base/java/lang/Math.html

Test your constructors and the new methods.

Part 3 : Create a class method,

contains(MyPoint[] points, MyPoint p), that checks if the point p is in the array points and returns a boolean. 

 Finally, add a class method horizontal(MyPoint[] points) that determines if an array of points is in a horizontal line and returns a boolean.

Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Knowledge Booster
Class
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
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education