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

Program plan:

LargestCountry.java:

  • Define a class named “LargestCountry”.
    • Define a function named “readCountry” with type “Country”.
      • Using the “Print” statement, prompt the user to enter the country name.
      • Using the scanner class, create an object “in” for reading the input values.
      • Using “next()” method gets the next string and store it into the variable “name”.
      • Using the “if” conditional statement, check whether the value of “name” is not equal to “quit”.
        • If the condition is true, then prompt the user to enter the country population.
        • Using the “nextInt()” method gets the next integer and store it into the variable “population”.
        • Using the “Print” statement, prompt the user to enter the country area.
        • Using the “nextDouble()” method gets the next double and store into the variable “area”.
        • Return a country “name”, “population”, and “area”.
      • Return “null”
    • Define a main function.
      • Create an object named “largestArea” of class country.
      • Create an object named “largestPopulation” of class country.
      • Create an object named “largestDensity” of class country.
      • Call the function “readCountry” and store the result into the object “b”.
      • Execute “While” block and check whether the value of “b” is not equal to “null”.
        • Using the “if” conditional statement, call the function “largerArea” and find the largest area.
          • If the condition is true, then store the largest area into the variable “largestArea”.
            • Using the “if” conditional statement, call the function “largerPopulation” and find the largest population.
              • If the condition is true, then store the largest population into the variable “largestPopulation”.
            • Using the “if” conditional statement, call the function “largerDensity” and find the largest density.
              • If the condition is true, then store the largest density into the variable “largestDensity”.
            • Call the function “readCountry” and store the result into the object “b”.
      • Using the “Print” statement, call the function “largestArea” and display the largest area.
      • Using the “Print” statement, call the function “largestPopulation” and display the largest population.
      • Using the “Print” statement, call the function “largestDensity” and display the largest density.

Country.java:

  • Define a class named “Country” for holding country information.
    • Declare three variables “name”, “population”, and “area”.
    • Create a constructor with three arguments.
      • Assign the value of the variable “name” into the variable “this.name”.
      • Assign the value of the variable “population” into the variable “this.population”.
      • Assign the value of the variable “area” into the variable “this.area”.
    • Define a function named “printCountry” and print the country name, population and area.
    • Define a double function named “getPopulationDensity”
      • Using the “if” conditional statement, check whether “area” is not equal to “0”.
        • If the condition is true, then return population density.
          • Else return “0”.
    • Define a boolean function named “largerPopulation” for finding which country has a larger population.
      • Return true if “this.population” is greater than “b.population”.
    • Define a boolean function named “largerDensity” for finding which country has larger population density.
      • Return true if “this.getPopulationDensity” is greater than “b.getPopulationDensity”.
    • Define a boolean function named “largerArea” for finding which country has a larger area.
      • Return true if “this.area” is greater than “b.area”.

Blurred answer
Students have asked these similar questions
MGMT SS STATS, an umbrella body that facilitates and serves various Social SecurityOrganizations/Departments within the Caribbean territories, stoodpoised to meet the needs of its stakeholders by launching an onlinedatabase at www.SSDCI.gov. The database will provide membersand the public access to the complete set of services that can (also)be initiated face-to-face, and it will provide managed, private, secure access to a repository ofpublic and/or personal information. Ideally, the database will have basic details of pensionplans recorded in the registry, member plan statistics, and cash inflows and outflows frompension funds.For example, insured persons accumulate contributions. Records for these persons will includeinformation on the insured persons able to acquire various benefits once work is interrupteddue to sickness, death, retirement, and maternity or employment injury. They will also includeinformation on pensions such as invalidity, disability, and survivors that stem from…
(c) Consider the following set of processes: Process ID Arrival Time Priority Burst Time A 2 3 100 B 6 C 10 1 (highest) 2 40 80 D 16 4 (lowest) 20
(3c) In the following resource allocation graph, is the state a deadlocked one? If so which ones are deadlocked? (3 points) Resource allocation graph. R₁ = Resource, P = process. R1 R3 R3 7

Chapter 8 Solutions

BIG JAVA: LATE OBJECTS

Ch. 8.3 - Prob. 11SCCh. 8.3 - Prob. 12SCCh. 8.3 - Prob. 13SCCh. 8.3 - Prob. 14SCCh. 8.4 - Prob. 15SCCh. 8.4 - Prob. 16SCCh. 8.4 - Prob. 17SCCh. 8.4 - Prob. 18SCCh. 8.5 - Prob. 19SCCh. 8.5 - Prob. 20SCCh. 8.5 - Prob. 21SCCh. 8.5 - Prob. 22SCCh. 8.6 - Prob. 23SCCh. 8.6 - Prob. 24SCCh. 8.6 - Prob. 25SCCh. 8.6 - Prob. 26SCCh. 8.6 - Prob. 27SCCh. 8.7 - Prob. 28SCCh. 8.7 - Prob. 29SCCh. 8.7 - Prob. 30SCCh. 8.8 - Prob. 31SCCh. 8.8 - Prob. 32SCCh. 8.8 - Prob. 33SCCh. 8.8 - Prob. 34SCCh. 8.9 - Prob. 35SCCh. 8.9 - Prob. 36SCCh. 8.9 - Prob. 37SCCh. 8.9 - Prob. 38SCCh. 8.9 - Prob. 39SCCh. 8.10 - Prob. 40SCCh. 8.10 - Prob. 41SCCh. 8.10 - Prob. 42SCCh. 8.10 - Prob. 43SCCh. 8.11 - Prob. 44SCCh. 8.11 - Prob. 45SCCh. 8.11 - Prob. 46SCCh. 8.11 - Prob. 47SCCh. 8.11 - Prob. 48SCCh. 8.12 - Prob. 49SCCh. 8.12 - Prob. 50SCCh. 8.12 - Prob. 51SCCh. 8 - Prob. 1RECh. 8 - Prob. 2RECh. 8 - Prob. 3RECh. 8 - Prob. 4RECh. 8 - Prob. 5RECh. 8 - Prob. 6RECh. 8 - Prob. 7RECh. 8 - Prob. 8RECh. 8 - Prob. 9RECh. 8 - Prob. 10RECh. 8 - Prob. 11RECh. 8 - Prob. 12RECh. 8 - Prob. 13RECh. 8 - Prob. 14RECh. 8 - Prob. 15RECh. 8 - Prob. 16RECh. 8 - Prob. 17RECh. 8 - Prob. 18RECh. 8 - Prob. 19RECh. 8 - Prob. 20RECh. 8 - Prob. 21RECh. 8 - Prob. 22RECh. 8 - Prob. 1PECh. 8 - Prob. 2PECh. 8 - Prob. 3PECh. 8 - Prob. 4PECh. 8 - Prob. 5PECh. 8 - Prob. 6PECh. 8 - Prob. 7PECh. 8 - Prob. 8PECh. 8 - Prob. 9PECh. 8 - Prob. 10PECh. 8 - Prob. 11PECh. 8 - Prob. 12PECh. 8 - Prob. 13PECh. 8 - Prob. 14PECh. 8 - Prob. 15PECh. 8 - Prob. 16PECh. 8 - Prob. 1PPCh. 8 - Prob. 2PPCh. 8 - Prob. 3PPCh. 8 - Prob. 4PPCh. 8 - Prob. 6PPCh. 8 - Prob. 7PPCh. 8 - Prob. 8PPCh. 8 - Prob. 9PPCh. 8 - Prob. 10PPCh. 8 - Prob. 11PPCh. 8 - Prob. 12PPCh. 8 - Prob. 13PPCh. 8 - Prob. 14PPCh. 8 - Prob. 15PPCh. 8 - Prob. 16PPCh. 8 - Prob. 17PPCh. 8 - Prob. 18PPCh. 8 - Prob. 19PPCh. 8 - Prob. 20PPCh. 8 - Prob. 21PPCh. 8 - Prob. 22PP
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