Big Java, Binder Ready Version: Early Objects
Big Java, Binder Ready Version: Early Objects
6th Edition
ISBN: 9781119056447
Author: Cay S. Horstmann
Publisher: WILEY
Question
Book Icon
Chapter 20, Problem 2PP
Program Plan Intro

Statistical data set

Program plan:

DataSetFrame.java:

  • Create a class named “DataSetFrame”. Inside the class,
    • Define the required components.
    • Set the width and height of the frame.
    • Define the “DataSetFrame ()” method.
      • Define the array list
      • Initialize the labels
      • Create a panel
      • Add the component to the panel
      • Set the frame size
    • Define the “getAverage ()” method.
      • Define the required variables.
      • Loop that iterates for the data set values.
      • Condition to compare the count values
    • Define the method “getMinimum ()” and inside,
      • Define the required variables.
      • Loop that iterates for the data set values.
      • Condition to compare the minimum values.
      • Return the minimum values.
    • Define the method “getMaximum ()” and inside,
      • Define the required variables.
      • Loop that iterates for the data set values.
      • Condition to compare the maximum values.
      • Return the maximum values.
    • Define the method “createAddButton ()” and inside,
      • Create a new button
      • Define the class “createAddButton ()” and inside.
        • Define the “actionPerformed ()” method
          • Set the values
          • Add the values
          • Assign the values obtained
          • Clear the text field.
        • Define the action listener
        • Add the button
        • Return the value

DataSetViewer.java

  • Create a class named “DataSetViewer”. Inside the class,
    • Define the “main()” method
      • Define the frame
      • Set the close operation
      • Set the visibility.

Blurred answer
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
Knowledge Booster
Background pattern image
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