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

Setting Alarm

Program plan:

Filename: “Clock.java”

This code snippet creates a class “Clock”. In the code,

  • Define a class “Clock”.
    • Define the class members “alarmOn”, “hour” and “minute”.
    • Define a method “setAlarm()”.
      • Set the value “hour”.
      • Set the value of “minute”.
      • Set the value of “true”.
    • Define the getter “getTime()”.
      • Get hours and minutes and set to a variable “result” as a string.
      • If “alarmOn” is true,
        • Get the hours and set to the variable “h”.
        • Get the minutes and set to the variable “m”.
        • If the condition is true,
          • Set the value of result.
          • Set “alarmOn” equal to false.
            • Return the value of “result”.
    • Define the getter “getHours()”.
      • Declare a variable “HOUR_START”.
      • Return the hours.
    • Define the getter “getMinutes()”.
      • Declare a variable “MINUTE_START”.
      • Return the hours.
    • Define the getter “getHours()”.
      • Declare a variable “HOUR_START”.
      • Return the hours.
    • Define the method “currentTime()”.
      • Return the current time.

Filename: “ClockDemo.java”

This code snippet creates a class “ClockDemo”. In the code,

  • Define a class “ClockDemo”.
    • Define the “main” method.
      • Create the object “clock” of class “Clock”.
      • Call the method “getHours()” and print the value.
      • Call the method “getMinutes()” and print the value.
      • Call the method “getTime()” and print the value.
      • Get the hours to a variable “h”.
      • Get the minutes to a variable “m”.
      • Call the method “setAlarm()”.
      • Print the time.
      • Print the time to check whether alarm is cleared.

Blurred answer
Students have asked these similar questions
Exercise 1 Function and Structure [30 pts] Please debug the following program and answer the following questions. There is a cycle in a linked list if some node in the list can be reached again by continuously following the next pointer. #include typedef struct node { int value; struct node *next; } node; int 11_has_cycle (node *first) if (first == node *head = { NULL) return 0; first; while (head->next != NULL) { } if (head first) { return 1; } head = head->next; return 0; void test ll_has_cycle () { int i; node nodes [6]; for (i = 0; i < 6; i++) { nodes [i] .next = NULL; nodes [i].value = i; } nodes [0] .next = &nodes [1]; nodes [1] .next = &nodes [2]; nodes [2] .next = &nodes [3]; nodes [3] .next nodes [4] .next &nodes [4]; NULL; nodes [5] .next = &nodes [0]; printf("1. Checking first list for cycles. \n Function 11_has_cycle says it has s cycle\n\n", 11_has_cycle (&nodes [0])?"a":"no"); printf("2. Checking length-zero list for cycles. \n Function 11_has_cycle says it has %s…
how to read log logs
Discrete Mathematics for Computer Engineering

Chapter 9 Solutions

BIG JAVA: LATE OBJECTS

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