Program Explanation Program: //Import required packages import javafx.application.Application; import javafx.geometry.Pos; import javafx.scene.Scene; import javafx.scene.control.Label; import javafx.scene.layout.BorderPane; import javafx.scene.layout.Pane; import javafx.scene.paint.Color; import javafx.scene.shape.Line; import javafx.scene.shape.Circle; import javafx.scene.text.Text; import javafx.stage.Stage; import java.util.Calendar; import java.util.GregorianCalendar; //Main class public class E28 extends Application { //Override start method @Override //Start method public void start(Stage primaryStage) { // Create a clock ClockPaneWithBooleanProperties clock =new ClockPaneWithBooleanProperties((int)(Math.random() * 12), (int)(Math.random() * 30), 0); //Create a string String timeString = clock.get_Hour() + ":" + clock.get_Minute() + ":" + clock.get_Second(); //Add the string to the label Label lblCurrentTime = new Label(timeString); //Create a pane BorderPane pane = new BorderPane(); //Set the clock to the center pane.setCenter(clock); //Set the label at the bottom pane.setBottom(lblCurrentTime); //Set the alignment BorderPane.setAlignment(lblCurrentTime, Pos.TOP_CENTER); // Create a scene Scene scene = new Scene(pane, 250, 250); //Set the title primaryStage.setTitle("Exercise14_28"); //Place the scene on the stage primaryStage.setScene(scene); //Display the stage primaryStage.show(); } //Main method public static void main(String[] args) { //Launch the application launch(args); } } //Create a class class ClockPaneWithBooleanProperties extends Pane { //Declare required variables private int clkhour; private int clkminute; private int clksecond; //Set the visibility to true private boolean hourHandVisible = true; private boolean minuteHandVisible = true; private boolean secondHandVisible = true; //Boolean function public boolean isHourHandVisible() { //Return the visibility return hourHandVisible; } //Function definition public void setHourHandVisible(boolean hourHandVisible) { //Set the visibility this.hourHandVisible = hourHandVisible; //Call the function paintClock(); } //Boolean function public boolean isMinuteHandVisible() { //Return the visibility return minuteHandVisible; } //Function definition public void setMinuteHandVisible(boolean minuteHandVisible) { //Set the visibility this.minuteHandVisible = minuteHandVisible; //Call the function paintClock(); } //Boolean function public boolean isSecondHandVisible() { //Return the visibility return secondHandVisible; } //Function definition public void setSecondHandVisible(boolean secondHandVisible) { //Set the visibility this.secondHandVisible = secondHandVisible; //Call the function paintClock(); } //Constructor public ClockPaneWithBooleanProperties() { //Get the time setCurrentTime(); } //Constructor public ClockPaneWithBooleanProperties(int h, int m, int s) { //Set the hour this.clkhour = h; //Set the minute this.clkminute = m; //Set the second this.clksecond = s; //Call the function paintClock(); } //Get hour public int get_Hour() { //Return hour return clkhour; } //Set hour public void set_Hour(int h) { //Set the hour this.clkhour = h; //Call the function paintClock(); } //Get minute public int get_Minute() { //Return minute return clkminute; } //Set minute public void set_Minute(int m) { //Set the minute this...

Introduction to Java Programming and Data Structures Comprehensive Version (11th Edition)

11th Edition

ISBN: 9780134700144

Author: Liang

Publisher: PEARSON

See similar textbooks

Videos

Question

Chapter 14, Problem 14.28PE

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 14, Problem 14.27PE

Chapter 14, Problem 14.29PE

Students have asked these similar questions

Create an original network topology consisting of at least seven routers and twelve links, assigning arbitrary positive weights to each link. Using this topology, apply Dijkstra's Link-State Algorithm to compute the shortest paths from a source router of your choice to all other routers in the network. Your topology must be entirely your own design and should not resemble any examples from the textbook, lecture slides, or other students' work. Al-generated topologies are not permitted. Create a PowerPoint presentation that follows the format and style of slides 11 to 23 from Lecture Slide Set 06 (LS06). You should copy those slides and make any necessary changes, additions, or deletions to reflect your own topology, shortest-path calculations, and update tables. Do not alter the original slide style, layout, or formatting.

x3003 x3008 1110 0000 0000 1100 1110 0010 0001 0000 0101 0100 1010 0000 x3004 0010 0100 0001 0011 x3005 0110 0110 0000 0000 X3006 0110 1000 0100 0000 x3007 0001 0110 1100 0100 0111 0110 0000 What does the following LC-3 program do? Trace Step by Step, SHOW ALL YOUR WORK. x3001 x3002 0000 x3009 0001 0000 0010 0001 X300A 0001 0010 0110 0001 x300B 0001 0100 1011 1111 x300C 0000 0011 1111 1000 X300D 1111 0000 0010 0101 x300E 0000 0000 0000 0101 x300F 0000 0000 0000 0100 x3010 0000 0000 0000 0011 x3011 0000 0000 0000 0110 x3012 0000 0000 0000 0010 x3013 x3014 0000 0000 0000 0000 0000 0100 0000 0111 x3015 0000 0000 0000 0110 x3016 0000 0000 0000 1000 x3017 0000 0000 0000 0111 x3018 0000 0000 0000 0101

Chapter 14 Solutions

Introduction to Java Programming and Data Structures Comprehensive Version (11th Edition)

Chapter 14.2, Problem 14.2.1CP Chapter 14.2, Problem 14.2.2CP Chapter 14.3, Problem 14.3.1CP Chapter 14.3, Problem 14.3.2CP Chapter 14.4, Problem 14.4.1CP Chapter 14.4, Problem 14.4.2CP Chapter 14.4, Problem 14.4.3CP Chapter 14.4, Problem 14.4.4CP Chapter 14.5, Problem 14.5.1CP Chapter 14.5, Problem 14.5.2CP

Additional Engineering Textbook Solutions

Find more solutions based on key concepts

Sum of ten numbers Program Plan: Include required header files. Define main function. Declare “int” variables f...

Problem Solving with C++ (10th Edition)

“toUpper()” and “toLower()” functions: The predefined functions of “toUpper()” and “toLower()” is to convert th...

Starting Out with Programming Logic and Design (5th Edition) (What's New in Computer Science)

Â To create a program whichfinds the amount of tip. Program Plan: Write a program in Visual Basic in which the ...

Introduction To Programming Using Visual Basic (11th Edition)

The portion of program that refers to the declared entity by its name is referred as scope. It refers to the li...

Java How to Program, Early Objects (11th Edition) (Deitel: How to Program)

The given program is rewritten with the “switch-case” statement instead of “if/else if” statement. // Header Fi...

Starting Out with C++ from Control Structures to Objects (9th Edition)

Properties of candidate keys.

Modern Database Management

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.