BIG JAVA: LATE OBJECTS
BIG JAVA: LATE OBJECTS
2nd Edition
ISBN: 9781119626220
Author: Horstmann
Publisher: WILEY
Question
Book Icon
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”.
    • 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”.
  • 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.

Blurred answer
Students have asked these similar questions
Objective: 1. Implement a custom Vector class in C++ that manages dynamic memory efficiently. 2. Demonstrate an understanding of the Big Five by managing deep copies, move semantics, and resource cleanup. 3. Explore the performance trade-offs between heap and stack allocation. Task Description: Part 1: Custom Vector Implementation 1. Create a Vector class that manages a dynamically allocated array. 。 Member Variables: ° T✶ data; // Dynamically allocated array for storage. std::size_t size; // Number of elements currently in the vector. std::size_t capacity; // Maximum number of elements before reallocation is required. 2. Implement the following core member functions: Default Constructor: Initialize an empty vector with no allocated storage. 。 Destructor: Free any dynamically allocated memory. 。 Copy Constructor: Perform a deep copy of the data array. 。 Copy Assignment Operator: Free existing resources and perform a deep copy. Move Constructor: Transfer ownership of the data array…
2.68♦♦ Write code for a function with the following prototype: * Mask with least signficant n bits set to 1 * Examples: n = 6 -> 0x3F, n = 17-> 0x1FFFF * Assume 1 <= n <= w int lower_one_mask (int n); Your function should follow the bit-level integer coding rules Be careful of the case n = W.
Hi-Volt Components You are the IT manager at Hi-Voltage Components, a medium-sized firm that makes specialized circuit boards. Hi-Voltage's largest customer, Green Industries, recently installed a computerized purchasing sys- tem. If Hi-Voltage connects to the purchasing system, Green Industries will be able to submit purchase orders electronically. Although Hi-Voltage has a computerized accounting system, that system is not capable of handling EDI. Tasks 1. What options does Hi-Voltage have for developing a system to connect with Green Industries' pur- chasing system? 2. What terms or concepts describe the proposed computer-to-computer relationship between Hi-Voltage and Green Industries? why not? 3. Would Hi-Voltage's proposed new system be a transaction processing system? Why or 4. Before Hi-Voltage makes a final decision, should the company consider an ERP system? Why or why not?

Chapter 6 Solutions

BIG JAVA: LATE OBJECTS

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
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