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 9, Problem 3PP
Program Plan Intro

Evaluation of Appointment

Program plan:

Filename: “Appointment.java”

This program file is used to define a class “Appointment”. In the code,

  • Define a class “Appointment”.
    • Define the class member “description”.
    • Define the constructor “Appointment()”.
      • initialize the value of “description”.
    • Define the method “setDescription()”.
      • Set the value of “description”.
    • Declare an abstract method “occursOn()”.
    • Define the method “toString()”.
      • Return the value of “description”.

Filename: “Monthly.java”

This program file is used to define a class “Monthly”. In the code,

  • Define a class “Monthly”.
    • Define the constructor “Monthly”.
      • Call the method “setDescription()”.
    • Define the method “occursOn()”.
      • Return the value “true”.

Filename: “Onetime.java”

This program file is used to define a class “Onetime”. In the code,

  • Define a class “Onetime”.
    • Define the constructor “Onetime”.
      • Call the method “setDescription()”.
      • Set the values of class members.
    • Define the method “occursOn()”.
      • Return the value “true”.

Filename: “Daily.java”

This program file is used to define a class “Daily”. In the code,

  • Define a class “Daily”.
    • Define the constructor “Daily”.
      • Call the method “setDescription()”.
    • Define the method “occursOn()”.
      • Return the value “true”.

Filename: “AppointmentTester.java”

This program file is used to define a class “AppointmentTester”. In the code,

  • Define a class “AppointmentTester”.
    • Define the method “main()”.
      • Print “Monthly is subclass of Appointment”.
      • Get the super class of “Monthly” and using “==” operator, check whether it matches with class “Appointment”.
      • Print the expected result.
      • Print “Onetime is subclass of Appointment”.
      • Get the super class of “Onetime” and using “==” operator, check whether it matches with class “Appointment”.
      • Print the expected result.
      • Print “Daily is subclass of Appointment”.
      • Get the super class of “Daily” and using “==” operator, check whether it matches with class “Appointment”.
      • Print the expected result.
      • Print the statement “Monthly appointments have no extra fields:”.
      • Get the length of declared fields of class “Monthly” and check whether it is equal to 1.
      • Print the expected result.
      • Print the statement “Onetime appointments have no extra fields:”.
      • Get the length of declared fields of class “Onetime” and check whether it is equal to 3.
      • Print the expected result.
      • Print the statement “Daily appointments have no extra fields:”.
      • Get the length of declared fields of class “Daily” and check whether it is equal to 0.
      • Print the expected result.
      • Define the object of class “Monthly”.
      • Check the daily appointment of “obj”.
      • Print the expected appointment.
      • Print the date of appointment.
      • Print the expected value.
      • Define the object of class “Onetime”.
      • Check the daily appointment of “obj”.
      • Print the expected appointment.
      • Print the date of appointment.
      • Print the expected value.
      • Define the object of class “Daily”.
      • Check the daily appointment of “obj”.
      • Print the expected appointment.
      • Print the date of appointment.
      • Print the expected value.

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

Chapter 9 Solutions

Big Java, Binder Ready Version: Early Objects

Ch. 9.3 - What is wrong with the following implementation of...Ch. 9.3 - What is wrong with the following implementation of...Ch. 9.3 - Look again at the implementation of the addChoice...Ch. 9.3 - In the Manager class of Self Check 7, override the...Ch. 9.3 - In the Manager class of Self Check 9, override the...Ch. 9.4 - Assuming SavingsAccount is a subclass of...Ch. 9.4 - Prob. 17SCCh. 9.4 - Declare an array quiz that can hold a mixture of...Ch. 9.4 - Prob. 19SCCh. 9.4 - Prob. 20SCCh. 9.5 - Prob. 21SCCh. 9.5 - Will the following code fragment compile? Will it...Ch. 9.5 - Prob. 23SCCh. 9.5 - Prob. 24SCCh. 9.5 - Prob. 25SCCh. 9 - Prob. 1RECh. 9 - Identify the superclass and subclass in each of...Ch. 9 - Prob. 3RECh. 9 - Which methods does the ChoiceQuestion class...Ch. 9 - Which methods does the SavingsAccount class in How...Ch. 9 - Prob. 6RECh. 9 - Suppose the class Sub extends the class Sandwich....Ch. 9 - Draw an inheritance diagram that shows the...Ch. 9 - Prob. 9RECh. 9 - What inheritance relationships would you establish...Ch. 9 - How does a cast such as (BankAccount) x differ...Ch. 9 - Prob. 12RECh. 9 - Implement a subclass of BankAccount called...Ch. 9 - Implement a subclass of BankAccount called...Ch. 9 - Reimplement the CheckingAccount class from How To...Ch. 9 - Add a class NumericQuestion to the question...Ch. 9 - Prob. 5PECh. 9 - Prob. 6PECh. 9 - Add a class AnyCorrectChoiceQuestion to the...Ch. 9 - Prob. 8PECh. 9 - Prob. 10PECh. 9 - Prob. 11PECh. 9 - Prob. 12PECh. 9 - Prob. 13PECh. 9 - Prob. 14PECh. 9 - Prob. 15PECh. 9 - Prob. 16PECh. 9 - Prob. 17PECh. 9 - Prob. 1PPCh. 9 - Prob. 2PPCh. 9 - Prob. 3PPCh. 9 - Prob. 4PPCh. 9 - Prob. 5PPCh. 9 - Prob. 6PPCh. 9 - Prob. 7PPCh. 9 - Prob. 8PP
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