(Geometry: n-sided regular polygon) An n-sided regular polygon's sides all have the same length and all of its angles have the same degree (i.e., the polygon is both equilateral and equiangular). Design a class named RegularPolygon that contains: 1 A private int data field named n that defines the number of sides in the polygon. A private float data field named side that stores the length of the side. 1 A private float data field named x that defines the x-coordinate of the center of the polygon with default value 0. I A private float data field named y that defines the y-coordinate of the center of the polygon with default value 0. 1 A constructor that creates a regular polygon with the specified n (default 3), side (default 1), x (default 0), and y (default 0). The accessor and mutator methods for all data fields. 1 The method getPerimeter() that returns the perimeter of the polygon. 1 The method getArea() that returns the area of the polygon. The formula for n × s² computing the area of a regular polygon is Area 4 X tan Draw the UML diagram for the class, and then implement the class. Write a test pro- gram that creates three RegularPolygon objects, created using RegularPolygon(), using RegularPolygon(6, 4) and RegularPolygon(10, 4, 5.6, 7.8). For each object, display its perimeter and area.
(Geometry: n-sided regular polygon) An n-sided regular polygon's sides all have the same length and all of its angles have the same degree (i.e., the polygon is both equilateral and equiangular). Design a class named RegularPolygon that contains: 1 A private int data field named n that defines the number of sides in the polygon. A private float data field named side that stores the length of the side. 1 A private float data field named x that defines the x-coordinate of the center of the polygon with default value 0. I A private float data field named y that defines the y-coordinate of the center of the polygon with default value 0. 1 A constructor that creates a regular polygon with the specified n (default 3), side (default 1), x (default 0), and y (default 0). The accessor and mutator methods for all data fields. 1 The method getPerimeter() that returns the perimeter of the polygon. 1 The method getArea() that returns the area of the polygon. The formula for n × s² computing the area of a regular polygon is Area 4 X tan Draw the UML diagram for the class, and then implement the class. Write a test pro- gram that creates three RegularPolygon objects, created using RegularPolygon(), using RegularPolygon(6, 4) and RegularPolygon(10, 4, 5.6, 7.8). For each object, display its perimeter and area.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Solve in python:
![(Geometry: n-sided regular polygon) An n-sided regular polygon's sides all have
the same length and all of its angles have the same degree (i.e., the polygon is
both equilateral and equiangular). Design a class named RegularPolygon that
contains:
I A private int data field named n that defines the number of sides in the polygon.
I A private float data field named side that stores the length of the side.
I A private float data field named x that defines the x-coordinate of the center of
the polygon with default value 0.
I A private float data field named y that defines the y-coordinate of the center of
the polygon with default value 0.
I A constructor that creates a regular polygon with the specified n (default 3),
side (default 1), x (default 0), and y (default 0).
The accessor and mutator methods for all data fields.
1 The method getPerimeter() that returns the perimeter of the polygon.
1 The method getArea() that returns the area of the polygon. The formula for
n × s²
computing the area of a regular polygon is Area =
TT
4 X tan
Draw the UML diagram for the class, and then implement the class. Write a test pro-
gram that creates three RegularPolygon objects, created using RegularPolygon(),
using RegularPolygon(6, 4) and RegularPolygon(10, 4, 5.6, 7.8). For
each object, display its perimeter and area.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F3e2b4b7b-6fb0-46af-9a81-55eddd25e84c%2F38a83bd6-4b1a-40bb-8b6c-2d8808558d8b%2Fh3i1jqk_processed.png&w=3840&q=75)
Transcribed Image Text:(Geometry: n-sided regular polygon) An n-sided regular polygon's sides all have
the same length and all of its angles have the same degree (i.e., the polygon is
both equilateral and equiangular). Design a class named RegularPolygon that
contains:
I A private int data field named n that defines the number of sides in the polygon.
I A private float data field named side that stores the length of the side.
I A private float data field named x that defines the x-coordinate of the center of
the polygon with default value 0.
I A private float data field named y that defines the y-coordinate of the center of
the polygon with default value 0.
I A constructor that creates a regular polygon with the specified n (default 3),
side (default 1), x (default 0), and y (default 0).
The accessor and mutator methods for all data fields.
1 The method getPerimeter() that returns the perimeter of the polygon.
1 The method getArea() that returns the area of the polygon. The formula for
n × s²
computing the area of a regular polygon is Area =
TT
4 X tan
Draw the UML diagram for the class, and then implement the class. Write a test pro-
gram that creates three RegularPolygon objects, created using RegularPolygon(),
using RegularPolygon(6, 4) and RegularPolygon(10, 4, 5.6, 7.8). For
each object, display its perimeter and area.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY