Big Java Late Objects
2nd Edition
ISBN: 9781119330455
Author: Horstmann
Publisher: WILEY
expand_more
expand_more
format_list_bulleted
Question
Chapter 9, Problem 11PE
Program Plan Intro
Class Person
Program plan:
Filename: “Person.java”
This program file is used to define a class “Person”. In the code,
- Define a class “Person”.
- Declare class members “name” and “birthYear”.
- Define a constructor “Person ()”.
- Initialize the “name” and “birthYear”.
- Define a method “toString()”.
- Return the value
Filename: “Instructor.java”
This program file is used to define a class “Instructor”. In the code,
- Define a class “Instructor”.
- Declare class members “salary”.
- Define a constructor “Instructor()”.
- Call the method “super()”.
- Set the value of “salary”.
- Define a method “toString()”.
- Return the value
Filename: “Student.java”
This program file is used to define a class “Student”. In the code,
- Define a class “Student”.
- Declare class members “major”.
- Define a constructor “Student ()”.
- Call the method “super()”.
- Set the value of “major”.
- Define a method “toString()”.
- Return the value
Filename: “PersonTester.java”
This program file is used to define a class “PersonTester”. In the code,
- Define a class “PersonTester”.
- Define a method “main()”.
- Declare the objects “p1” and “p2” of class “Person”.
- Declare the objects “s1” and “s2” of class “Person”.
- Declare the object “e” of class “Instructor”.
- Print the value of “p1”.
- Print the expected value of “p1”.
- Print the value of “p2”.
- Print the expected value of “p2”.
- Print the value of “s1”.
- Print the expected value of “s1”.
- Print the value of “s2”.
- Print the expected value of “s2”.
- Print the value of “e”.
- Print the expected value of “e”.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
module : java 731
Question3: (30 MARKS) Passenger Rail Agency for South Africa Train Scheduling System Problem Statement Design and implement a train scheduling system for Prasa railway network. The system should handle the following functionalities: 1. Scheduling trains: Allow the addition of train schedules, ensuring that no two trains use the same platform at the same time at any station. 2. Dynamic updates: Enable adding new train schedules and canceling existing ones. 3. Real-time simulation: Use multithreading to simulate the operation of trains (e.g., arriving, departing). 4. Data management: Use ArrayList to manage train schedules and platform assignments. Requirements 1. Add Train Schedule, Cancel Scheduled Train, View Train Schedules and Platform Management 2. Concurrency Handling with Multithreading i.e Use threads to simulate train operations,…
please answer my 2 java questions correctly , include all comments etc and layout and structure must be correct , follow the requirements
Question3:
Passenger Rail Agency for South Africa Train Scheduling System
Problem Statement
(30 MARKS)
Design and implement a train scheduling system for Prasa railway network. The system should
handle the following functionalities:
1. Scheduling trains: Allow the addition of train schedules, ensuring that no two trains use the
same platform at the same time at any station.
2. Dynamic updates: Enable adding new train schedules and canceling existing ones.
3. Real-time simulation: Use multithreading to simulate the operation of trains (e.g., arriving,
departing).
4. Data management: Use ArrayList to manage train schedules and platform assignments.
Requirements
1. Add Train Schedule, Cancel Scheduled Train, View Train Schedules and Platform
Management
2. Concurrency Handling with Multithreading i.e Use threads to simulate train operations,
Each train runs as a separate thread, simulating its arrival, departure, and travel status.
3. Use ArrayList to manage train schedules for each…
Chapter 9 Solutions
Big Java Late Objects
Ch. 9.1 - Prob. 1SCCh. 9.1 - Prob. 2SCCh. 9.1 - Prob. 3SCCh. 9.1 - Prob. 4SCCh. 9.1 - Prob. 5SCCh. 9.2 - Prob. 6SCCh. 9.2 - Prob. 7SCCh. 9.2 - Prob. 8SCCh. 9.2 - Prob. 9SCCh. 9.2 - Prob. 10SC
Ch. 9.3 - Prob. 11SCCh. 9.3 - Prob. 12SCCh. 9.3 - Prob. 13SCCh. 9.3 - Prob. 14SCCh. 9.3 - Prob. 15SCCh. 9.4 - Prob. 16SCCh. 9.4 - Prob. 17SCCh. 9.4 - Prob. 18SCCh. 9.4 - Prob. 19SCCh. 9.4 - Prob. 20SCCh. 9.5 - Prob. 21SCCh. 9.5 - Prob. 22SCCh. 9.5 - Prob. 23SCCh. 9.5 - Prob. 24SCCh. 9.5 - Prob. 25SCCh. 9.6 - Prob. 26SCCh. 9.6 - Prob. 27SCCh. 9.6 - Prob. 28SCCh. 9.6 - Prob. 29SCCh. 9.6 - Prob. 30SCCh. 9.6 - Prob. 31SCCh. 9 - Prob. 1RECh. 9 - Prob. 2RECh. 9 - Prob. 3RECh. 9 - Prob. 4RECh. 9 - Prob. 5RECh. 9 - Prob. 6RECh. 9 - Prob. 7RECh. 9 - Prob. 8RECh. 9 - Prob. 9RECh. 9 - Prob. 10RECh. 9 - Prob. 11RECh. 9 - Prob. 12RECh. 9 - Prob. 13RECh. 9 - Prob. 14RECh. 9 - Prob. 15RECh. 9 - Prob. 16RECh. 9 - Prob. 1PECh. 9 - Prob. 2PECh. 9 - Prob. 3PECh. 9 - Prob. 4PECh. 9 - Prob. 7PECh. 9 - Prob. 8PECh. 9 - Prob. 9PECh. 9 - Prob. 10PECh. 9 - Prob. 11PECh. 9 - Prob. 12PECh. 9 - Prob. 13PECh. 9 - Prob. 14PECh. 9 - Prob. 15PECh. 9 - Prob. 16PECh. 9 - Prob. 18PECh. 9 - Prob. 19PECh. 9 - Prob. 20PECh. 9 - Prob. 21PECh. 9 - Prob. 22PECh. 9 - Prob. 23PECh. 9 - Prob. 1PPCh. 9 - Prob. 2PPCh. 9 - Prob. 3PPCh. 9 - Prob. 4PPCh. 9 - Prob. 5PPCh. 9 - Prob. 6PPCh. 9 - Prob. 7PPCh. 9 - Prob. 8PPCh. 9 - Prob. 9PPCh. 9 - Prob. 10PPCh. 9 - Prob. 11PPCh. 9 - Prob. 12PPCh. 9 - Prob. 13PPCh. 9 - Prob. 14PPCh. 9 - Prob. 15PPCh. 9 - Prob. 16PPCh. 9 - Prob. 17PPCh. 9 - Prob. 18PPCh. 9 - Prob. 19PPCh. 9 - Prob. 20PPCh. 9 - Prob. 21PPCh. 9 - Prob. 22PPCh. 9 - Prob. 23PP
Knowledge Booster
Similar questions
- please answer my java question correctly , include all comments etc and layout and structure must be correct , follow the requirementsarrow_forwardplease answer my java question correctly , include all comments etc and layout and structure must be correct , follow the requirementsarrow_forwardplease answer my java question correctly , follow all requirements , add all commets etc and layout and structure must be perfect tooarrow_forward
- please answer my java question correctly , include all comments etc and layout and structure must be correct , follow the requirementsarrow_forward7. Long-Distance CallsA long-distance provider charges the following rates for telephone calls: Rate Category Rate per MinuteDaytime (6:00 a.m. through 5:59 p.m.) $0.07Evening (6:00 p.m. through 11:59 p.m.) $0.12Off-Peak (midnight through 5:59 a.m.) $0.05Write a GUI application that allows the user to select a rate category (from a set of radio buttons), and enter the number of minutes of the call into an Entry widget. An info dialog box should display the charge for the call.arrow_forwardName and Address The Name and Address Problem Write a GUI program that displays your name and address when a button is clicked. The program’s window should appear as the sketch on the left side of Figure 13-61 when it runs. When the user clicks the Show Info button, the program should display your name and address, as shown in the sketch on the right of the figure.arrow_forward
- 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…arrow_forwardhow to read log logsarrow_forwardDiscrete Mathematics for Computer Engineeringarrow_forward
- Question 1 - Array Iterators Like the JS on A2, there is no visual component to this question. The HTML really just needs to load the JavaScript, everything else will output to the console. The JS file should the completion of the task, and all necessary testing, so that just loading the file will complete the task with enough different inputs to ensure it works. Even Numbers [3 marks] Create a function that determines if a provided number is even. Define an array of numbers, then on the array use the appropriate array iterator to determine if the array contains only even numbers using the function you defined. Output the results, and test with several arrays. Long Names [3 marks] Define an array of names. Use an iterator to retrieve a new array containing only the names longer then 12 characters. Your iterator should be passed an anonymous arrow function. Test with several different arrays First Names [3 marks] Define an array called fullNames that contains 7 javascript objects of…arrow_forwardDiscrete Mathematics for Computer Engineeringarrow_forwardthis module is java 731 . make sure my answers are 1005 correct and the layout and structure is perfect and also include all comments etc. thank you i have attached question 1 (40 marks) and question 2 (30 marks ) this is question 3: Question3: (30 MARKS) Passenger Rail Agency for South Africa Train Scheduling System Problem Statement Design and implement a train scheduling system for Prasa railway network. The system should handle the following functionalities: 1. Scheduling trains: Allow the addition of train schedules, ensuring that no two trains use the same platform at the same time at any station. 2. Dynamic updates: Enable adding new train schedules and canceling existing ones. 3. Real-time simulation: Use multithreading to simulate the operation of trains (e.g., arriving, departing). 4. Data management: Use ArrayList to manage train schedules and…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education