BIG JAVA: LATE OBJECTS
BIG JAVA: LATE OBJECTS
2nd Edition
ISBN: 9781119626220
Author: Horstmann
Publisher: WILEY
Question
Book Icon
Chapter 24, Problem 9PP
Program Plan Intro

Polygon

Program plan:

Filename: “JFrame.java”

This program file is used to define a class “JFrame”. In the code,

  • Import the required packages.
  • Define a class “JFrame”.
    • Declare class members “size”, “components”.
    • Define a constructor “setSize”.
      • Initialize the class members.
    • Define a method “setDefaultCloseOperation()”.
    • Define a method “add()”.
    • Define a method “setVisible()”.
      • Define string.
      • Declare variable rect.
      • Define graphics and then set the properties.
      • Inside the try statement,
        • Declare string extension.
          • Inside the catch statement,
            • Print the statement.

Filename: “PolygonComponent.java”

This program file is used to define a class “PolygonComponent”. In the code,

  • Import the required packages.
  • Define a class “PolygonComponent”.
    • Declare the class members “polygon”.
    • Define a method “PolygonComponent()”.
      • Define “ploygon”.
    • Define a method “paintComponent()”.
      • Define Graphics2D “g2”.

Filename: “PolygonParser.java”

This program file is used to define a class “PolygonParser”. In the code,

  • Import the required packages.
  • Define a class “PolygonParser”.
    • Declare the class members “builder”, “path”.
    • Define the constructor “PolygonParser()”.
      • Declare DocumentBuilderFactory “factory”.
      • Declare “builder”.
      • Declare XPathFactory “xpfactory”.
      • Declare “path”.
    • Define a method “parse()”.
      • Declare file “f”.
      • Declare Document “doc”.
      • Define statement “points”.
      • Inside the for loop,
        • Define variables “x”, “y”.

Filename: “PolygonViewer.java”

This program file is used to define a class “PolygonViewer”. In the code,

  • Import the required packages.
  • Define a class “PolygonViewer”.
    • Define class main.
    • Define PolygonParser “rp”.
    • Define PolygonComponent “ellipsecomponent”.
    • Define JFrame “frame”.

Filename: “polygon.xml”

This program file is used to define an XML file “polygon”. In the code,

  • Open the polygon tag.
    • Open the point tag.
    • Create an element named “x”.
    • Create an element named “y”.
    • Close the point tag.
    • Open the point tag.
    • Create an element named “x”.
    • Create an element named “y”.
    • Close the point tag.
    • Open the point tag.
    • Create an element named “x”.
    • Create an element named “y”.
    • Close the point tag.
    • Open the point tag.
    • Create an element named “x”.
    • Create an element named “y”.
    • Close the point tag.
    • Open the point tag.
    • Create an element named “x”.
    • Create an element named “y”.
    • Close the point tag.
  • Close the polygon tag.

Blurred answer
Students have asked these similar questions
Ideal MOSFET Current–Voltage Characteristics—NMOS Device and draw the circuit
1. Create a Person.java file. Implement the public Person and Student classes in Person.java, including all the variables and methods in the UMLS. Person -name: String -street: String -city: String +Person(String name, String, street, String, city) +getName(): String +setName(String name): void +getStreet(): String +setStreet(String street): void +getCity(): String +setCity(String City): void +toString(): String Student -Id: int +Person(String name, String, street, String, city, int Id) +getId(): int +setId(int Id): void +toString(): String 2. Create a StudentTest.java file. Implement a public StudentTest class with a main method. In the main method, create one student object and print the object using System.out.println(). Your printing result must follow the example output: name: Mike, street: Morris Ave, city: Union, Id: 1000 Hint: You need to modify the toString methods in the Student class and Person class!
1) Apply the Paint Blue algorithm discussed in class to the following Finite Automata. a a a b b a COIS-3050H-R-W01-2025WI-COMB Formal Languages & Automata a b Show the status of the Finite Automata at the conclusion of the Paint Blue Algorithm (mark the visited states with an X and only include edges that have not been followed). 2) Use the pumping lemma to prove the following language is nonregular: L= {ab} = {abbb, aabbbbbb, aaabbbbbbbbb, ...}
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education