Big Java Late Objects
Big Java Late Objects
2nd Edition
ISBN: 9781119330455
Author: Horstmann
Publisher: WILEY
Question
Book Icon
Chapter 24, Problem 12PP
Program Plan Intro

  To design an XML format for the appointments in an appointment calendar

Program plan:

  • In the file AppointmentDate.java”, import necessary package, and create a class AppointmentDate”,
    • Declare necessary variables.
    • Define the constructor.
    • Define the method “equals()” to determine if the dates are equal.
    • Define the method “toString()” to print a string representation of the date.
  • In the file AppointmentTime.java”, import necessary package, and create a class AppointmentTime”,
    • Declare necessary variables.
    • Define the constructor.
    • Define the method “hashCode()” to get the hash code..
    • Define the method “equals()” to determine if the appointment times are equal.
    • Define the method “toString()” to print a string representation of the time.
  • In the file AppointmentCalendar.java”, import necessary package, and create a class AppointmentCalendar”,
    • Declare an array list.
    • Define the constructor.
    • Define the method “add()” to add an appointment to the calendar.
    • Define the method “cancel()” to cancel an appointment from the calendar.
    • Define the method “getAppointmentsForDay()” to get all appointments for a certain date.
    • Define the method “getAllAppointments()” to get all appointments.
  • In the file Appointment.java”, import necessary package, and create a class Appointment”,
    • Declare necessary variables.
    • Define the constructor.
    • Define the method “equals()” to determine if the appointment is the same as another appointment.
    • Define the method “hashCode()” to get the hash code.
    • Define the method “fallsOn()” to determine if an appointment falls on a certain day.
    • Define the method “format()” to format the appointment.
    • Define the method “getDescription()” to get the description.
    • Define the method “getDay()” of type “AppointmentDate” to get the day.
    • Define the method “getFrom()” of type “AppointmentTime” to get the "from" time.
    • Define the method “getTo()” of type “AppointmentTime” to get the "to" time.
  • In the file AppointmentParser.java”, import necessary packages, and create a class AppointmentParser”,
    • Declare necessary variables.
    • Define the constructor.
    • Define the method “parseCalendar()” to parse an “AppointmentCalendar” from the given file.
    • Define the method “parseCommands()” to write an AppointmentCalendar to the given file.
  • In the file AppointmentSystem.java”, import necessary packages, and create a class AppointmentSystem”,
    • Define the method “main()”,
      • If the arguments length is less than “2”.
        • Print the message.
      • Create required file objects.
      • Execute “try” statement.
        • Create an object for “AppointmentParser”.
        • Parse calendar from file.
        • Call the method to parse and run commands from file.
        • Call the method to write the calendar.
      • Catch and handle “XPathExpressionException” exception.
      • Catch and handle “ParserConfigurationException” exception.
      • Catch and handle “TransformerConfigurationException” exception.
      • Catch and handle “TransformerException” exception.
      • Catch and handle “SAXException” exception.
      • Catch and handle “IOException” exception.

Blurred answer
Students have asked these similar questions
A3Q3.c - You are to write a C program that implements the following disk scheduling algorithms: a. FCFS [10 marks] b. SCAN [10 marks] c. C-SCAN [10 marks] d. SSTF [10 marks] e. LOOK [10 marks] f. C-LOOK [10 marks] • Your program will service a disk with 300 cylinders numbered 0 to 299. • • • • The program will service the requests (a list of 20 cylinder numbers) given in the file request.bin. This file contains (4 byte) integer values representing requests ranging from 0-299. Your program will take the initial position of the disk head as the first command line argument and the direction of the head as the second command line argument. It will then output the requests in the order in which they are serviced, and the total amount of head movements required by each algorithm. In particular, your program needs to do the following: Your program should take two command line arguments a) First command line argument - initial position of the disk head (an integer value) b) Second command line…
2. The memory management has contiguous memory allocation, dynamic partitions, and paging. Compare the internal fragmentation and external fragmentation for these three approaches. [2 marks] 3. Suppose we have Logical address space = 24 = 16 (m = 4), Page size=2² =4 (n = 2), Physical address space = 26 = 64 (r = 6). Answer the following questions: [4 marks] 1) Total # of pages ? 2) Total # of frames ? 3) Number of bits to represent logical address? 4) Number of bits to represent offset ? 5) Number of bits to represent physical address? 6) Number of bits to represent a page number? 7) Number of bits to represent a frame number / 4. What is translation look-aside buffers (TLBS)? Why we need them to implement the page table? [2 marks] 5. Why we need shared pages for multiple processes? Give one example to show the benefits. [2 marks] 6. How to implement the virtual memory by using page out and page in? Explain with an example. [2 marks] 7. We have a reference string of referenced page…
8. List three HDD scheduling algorithms. [2 marks] 9. True or False? The NVM has the same scheduling algorithms with HDD. Explain why? [2 marks] 10. Why the modern mouses use polling to detect movements instead of interrupts? [2 marks] 11. What is thrashing? How does it happen? [2 marks] 12. Given a reference string of page numbers 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 and 4 frames show how the page replacement algorithms work, and how many page faults? [6 marks], 1) FIFO algorithm? [2 marks] 2) Optimal algorithm? [2 marks] 3) LRU algorithm? [2 marks] 13. List at least three file systems that you know. [2 marks] 14. In C programming, how the seek to a specific position in the file by offset? [2 marks]
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