Big Java Late Objects
2nd Edition
ISBN: 9781119330455
Author: Horstmann
Publisher: WILEY
expand_more
expand_more
format_list_bulleted
Question
Chapter 6, Problem 17PE
Program Plan Intro
Program plan:
BarChartWithPositiveNegative.java
- Create a class named “BarChartWithPositiveNegative”.
- Define a function named “readinputValues”.
- Create an ArrayList object called “listofarr”, which will store integer values.
- Using “while(in.hasNextInt())” loop, read all input values and add elements to the array list using “add()” method .
- Return “listofarr”.
- Define an “int” function named “findMaxElement”.
- Declare an integer variable named “maxval” and access the list using “get()” method.
- Using enhanced “for” loop, iterate and find the maximum value in the array list.
- Inside the loop, the conditional statement “if” checks whether “a” is greater than “maxval” or not
- If the condition is true, the maximum value will be stored in the variable “maxval”
- Return “maxval”.
- Inside the loop, the conditional statement “if” checks whether “a” is greater than “maxval” or not
- Define an “int” function named “findMinElement”.
- Declare an integer variable named “minval” and access the list using “get()” method.
- Using enhanced “for” loop, iterate and find the maximum value in the array list.
- Inside the loop, the conditional statement “if” checks whether “b” is greater than “minval” or not
- If the condition is true, the maximum value will be stored in the variable “minval”
- Return “minval”.
- Inside the loop, the conditional statement “if” checks whether “b” is greater than “minval” or not
- Define a function named “readinputValues”.
- Define a function named “printBarChartforposneg”.
- Declare an integer variable named “maximum” and call the function “findMaxElement”.
- Declare an integer variable named “minimum” and call the function “findMinElement”.
- Initialize “posAsterisk” as “40”.
- Initialize “negAsterisk” as “0”.
- Using “if” conditional statement, check whether the “Math.abs(minimum)” is greater than “maximum” or not.
- If the condition is true, assign the value “40” into variable “negAsterisk” and then compute positive asterisks and store into the variable “posAsterisk”.
- Else if check whether the minimum value is less than “0” or not and then compute negative asterisk and store into variable “negAsterisk”.
- Using “for” loop, print and generate the bar chart.
- Inside the “for” loop, using “get()” method retrieve a number from the values and store into the variable “num”.
- Using the “if” conditional statement, check whether the “num” is greater than “0” or not.
- If the condition is true, compute the number of asterisks and store into the variable “asterisks”.
- Using “for” loop, print empty spaces for negative asterisks on the screen.
- Using “for” loop, print asterisks on the screen.
- Else, it computes the number of asterisk and stores it into the variable “asterisks”.
- Using “for” loop, print spaces for the negative asterisks.
- Using “for” loop, print asterisks on the screen.
- Define a main function.
- Declare an array list variable named “Arrlist” and call the function “readinputvalues” to read a sequence of positive and negative values.
- Call the function "printBarChartforposneg" and pass “Arrlist” as parameter for displaying the bar chart of asterisks based on the input list and maximum and minimum values in the array list.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionChapter 6 Solutions
Big Java Late Objects
Ch. 6.1 - Prob. 1SCCh. 6.1 - Prob. 2SCCh. 6.1 - Prob. 3SCCh. 6.1 - Prob. 4SCCh. 6.1 - Prob. 5SCCh. 6.1 - Prob. 6SCCh. 6.1 - Prob. 7SCCh. 6.2 - Prob. 8SCCh. 6.2 - Prob. 9SCCh. 6.2 - Prob. 10SC
Ch. 6.2 - Prob. 11SCCh. 6.3 - Prob. 12SCCh. 6.3 - Prob. 13SCCh. 6.3 - Prob. 14SCCh. 6.3 - Prob. 15SCCh. 6.3 - Prob. 16SCCh. 6.3 - Prob. 17SCCh. 6.3 - Prob. 18SCCh. 6.4 - Prob. 19SCCh. 6.4 - Prob. 20SCCh. 6.4 - Prob. 21SCCh. 6.4 - Prob. 22SCCh. 6.4 - Prob. 23SCCh. 6.5 - Prob. 24SCCh. 6.5 - Prob. 25SCCh. 6.5 - Prob. 26SCCh. 6.5 - Prob. 27SCCh. 6.5 - Prob. 28SCCh. 6.6 - Prob. 29SCCh. 6.6 - Prob. 30SCCh. 6.6 - Prob. 31SCCh. 6.6 - Prob. 32SCCh. 6.6 - Prob. 33SCCh. 6.7 - Prob. 34SCCh. 6.7 - Prob. 35SCCh. 6.7 - Prob. 36SCCh. 6.7 - Prob. 37SCCh. 6.7 - Prob. 38SCCh. 6.8 - Prob. 39SCCh. 6.8 - Prob. 40SCCh. 6.8 - Prob. 41SCCh. 6.8 - Prob. 42SCCh. 6.8 - Prob. 43SCCh. 6.8 - Prob. 44SCCh. 6.8 - Prob. 45SCCh. 6 - Prob. 1RECh. 6 - Prob. 2RECh. 6 - Prob. 3RECh. 6 - Prob. 4RECh. 6 - Prob. 5RECh. 6 - Prob. 6RECh. 6 - Prob. 7RECh. 6 - Prob. 8RECh. 6 - Prob. 9RECh. 6 - Prob. 10RECh. 6 - Prob. 11RECh. 6 - Prob. 12RECh. 6 - Prob. 13RECh. 6 - Prob. 14RECh. 6 - Prob. 15RECh. 6 - Prob. 16RECh. 6 - Prob. 17RECh. 6 - Prob. 18RECh. 6 - Prob. 19RECh. 6 - Prob. 20RECh. 6 - Prob. 21RECh. 6 - Prob. 22RECh. 6 - Prob. 23RECh. 6 - Prob. 24RECh. 6 - Prob. 25RECh. 6 - Prob. 26RECh. 6 - Prob. 27RECh. 6 - Prob. 28RECh. 6 - Prob. 29RECh. 6 - Prob. 30RECh. 6 - Prob. 31RECh. 6 - Prob. 32RECh. 6 - Prob. 33RECh. 6 - Prob. 34RECh. 6 - Prob. 1PECh. 6 - Prob. 3PECh. 6 - Prob. 4PECh. 6 - Prob. 5PECh. 6 - Prob. 6PECh. 6 - Prob. 7PECh. 6 - Prob. 8PECh. 6 - Prob. 9PECh. 6 - Prob. 10PECh. 6 - Prob. 11PECh. 6 - Prob. 12PECh. 6 - Prob. 13PECh. 6 - Prob. 15PECh. 6 - Prob. 16PECh. 6 - Prob. 17PECh. 6 - Prob. 18PECh. 6 - Prob. 19PECh. 6 - Prob. 20PECh. 6 - Prob. 21PECh. 6 - Prob. 23PECh. 6 - Prob. 24PECh. 6 - Prob. 25PECh. 6 - Prob. 26PECh. 6 - Prob. 27PECh. 6 - Prob. 28PECh. 6 - Prob. 29PECh. 6 - Prob. 1PPCh. 6 - Prob. 2PPCh. 6 - Prob. 3PPCh. 6 - Prob. 4PPCh. 6 - Prob. 5PPCh. 6 - Prob. 6PPCh. 6 - Prob. 7PPCh. 6 - Prob. 8PPCh. 6 - Prob. 9PPCh. 6 - Prob. 10PPCh. 6 - Prob. 11PPCh. 6 - Prob. 12PPCh. 6 - Prob. 13PPCh. 6 - Prob. 14PPCh. 6 - Prob. 15PPCh. 6 - Prob. 16PPCh. 6 - Prob. 17PPCh. 6 - Prob. 18PPCh. 6 - Prob. 19PP
Knowledge Booster
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
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)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education