Display list Program plan: Filename: “UsedCarException.java” Define “UsedCarException” class which extends from “Exception” class Define the constructor Call the super method. Filename: “UsedCar.java” Define the “UsedCar” class Declare the required variables and set the values Define the default constructor Set the values Define the parameterized constructor Set the values Check “num” length is not equal to “VIN_NUM_LENGTH” Set the value Iterate “x” until it reaches “num” length Check “num” is not a digit Set the value Iterate “x” until it reaches “MALES” length Check “carMake” is not equal to “MAKES [x]” Set the value Check “isGoodMake” is false Set the value Check “carYear” is less than “LOW_YEAR” or greater than “HIGH_YEAR or “miles” less than 0 or “pr” less than 0 Set the value Check “isBad” is true Throw an exception Set the values Define the “getVin” method Set the values Define the “toString” method Return the values. Filename: “ThrowUsedCarException.java” Define the class “ThrowUsedCarException” Define the “main” method Create an object for “UsedCar” class Declare the variables and set the required values to the variables Iterate “for” loop until it reaches length of the “UsedCar” Set the values to the object Iterate “for” loop until it reaches length of the “UsedCar” In “try” block, set the values In “catch” block, display the course and error Display the course values

Question

Want to see the full answer?

Answer 1

Question

Chapter 12, Problem 7PE

Program Plan Intro

Display list

Program plan:

Filename: “UsedCarException.java”

Define “UsedCarException” class which extends from “Exception” class

Define the constructor

Call the super method.

Filename: “UsedCar.java”

Define the “UsedCar” class

Declare the required variables and set the values

Define the default constructor

Set the values

Define the parameterized constructor

Set the values

Check “num” length is not equal to “VIN_NUM_LENGTH”

Set the value

Iterate “x” until it reaches “num” length

Check “num” is not a digit

Set the value

Iterate “x” until it reaches “MALES” length

Check “carMake” is not equal to “MAKES [x]”

Set the value

Check “isGoodMake” is false

Set the value

Check “carYear” is less than “LOW_YEAR” or greater than “HIGH_YEAR or “miles” less than 0 or “pr” less than 0

Set the value

Check “isBad” is true

Throw an exception

Set the values

Define the “getVin” method

Set the values

Define the “toString” method

Return the values.

Filename: “ThrowUsedCarException.java”

Define the class “ThrowUsedCarException”

Define the “main” method

Create an object for “UsedCar” class

Declare the variables and set the required values to the variables

Iterate “for” loop until it reaches length of the “UsedCar”

Set the values to the object

Iterate “for” loop until it reaches length of the “UsedCar”

In “try” block, set the values

In “catch” block, display the course and error

Display the course values

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Question D.4: FIFO Page Replacement Consider the following page reference string: e, c, b, e, a, g, d, c, e, g, d, a Considering 4 frames, fill in the following table and then answer how many page faults would occur with the FIFO page replacement algorithm. RS: reference string; FO: frame 0, F1: frame 1, etc. Hint: all frames are initially empty, so your first unique pages will all cost one fault each. Time 1234567891011 12 RS e cb e agd ce g d a FO F1 F2 F3 Page fault? b) Total # page faults: c) Briefly (1-2 sentences) explain Belady's Anomaly that can occur in FIFO Page Replacement.

Consider a system that uses a fixed-partition scheme, with equal partitions of size 2" bytes, and the main memory has 2¹8 bytes. A process table is maintained with a pointer to the resident partition for each resident process. How many bits are required for the pointer in the process table? Show all your steps.

Use the same semaphore notation shown above to describe how we can ensure the execution order of the following process execution graph: P6 P2 P7 P1 P3 P4 P5 Use all of the following semaphores in your answer: s1=0; s2=0; s3=0; s4=0; s5=0; s6=0;