
Patient Charges
Write a class named Patient that has member variables for the following data:
• First name, middle name, last name
• Address, city, state, and ZIP code
• Phone number
• Name and phone number of emergency contact
The Patient class should have a constructor that accepts an argument for each member variable. The Patient class should also have accessor and mutator functions for each member variable.
Next, write a class named Procedure that represents a medical procedure that has been performed on a patient. The Procedure class should have member variables for the following data:
• Name of the procedure
• Date of the procedure
• Name of the practitioner who performed the procedure
• Charges for the procedure
The Procedure class should have a constructor that accepts an argument for each member variable. The Procedure class should also have accessor and mutator functions for each member variable.
Next, write a program that creates an instance of the Patient class, initialized with sample data. Then, create three instances of the Procedure class, initialized with the following data:
Procedure #1: | Procedure #2: | Procedure #3: |
Procedure name: Physical Exam | Procedure name: X-ray | Procedure name: Blood test |
Date: Today’s date | Date: Today’s date | Date: Today’s date |
Practitioner: Dr. Irvine | Practitioner: Dr. Jamison | Practitioner: Dr. Smith |
Charge: 250.00 | Charge: 500.00 | Charge: 200.00 |
The program should display the patient’s information, information about all three of the procedures, and the total charges of the three procedures.

Want to see the full answer?
Check out a sample textbook solution
Chapter 13 Solutions
STARTING OUT W/C++,...(LL)-W/ACCESS
Additional Engineering Textbook Solutions
Database Concepts (8th Edition)
Concepts Of Programming Languages
SURVEY OF OPERATING SYSTEMS
Starting Out with Java: From Control Structures through Objects (7th Edition) (What's New in Computer Science)
Starting Out with Python (4th Edition)
Java: An Introduction to Problem Solving and Programming (8th Edition)
- 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.arrow_forward4. |z + 5 - 5i| = 7arrow_forward14. dz, C: |z❘ C: |z❘ = 0.6 ze² - 2iz Harrow_forward
- EBK JAVA PROGRAMMINGComputer ScienceISBN:9781337671385Author:FARRELLPublisher:CENGAGE LEARNING - CONSIGNMENTMicrosoft Visual C#Computer ScienceISBN:9781337102100Author:Joyce, Farrell.Publisher:Cengage Learning,C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
- C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology PtrProgramming Logic & Design ComprehensiveComputer ScienceISBN:9781337669405Author:FARRELLPublisher:CengageSystems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning




