Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Write a class Date. The Date has a day (type is int), month (type is int), year (type is int), and time (type is int)

image text in transcribed

Write a class Date. The Date has a day (type is int), month (type is int), year (type is int), and time (type is int) Write a class Meeting. The Meeting has a date (type is Date), place (type is String), and topic (type is String). The Meeting class has a static member: numberofMeetings to keep track of the number of meetings created 1. Draw the UML diagram of your classes 2. Add accessors and mutators to your classes. 3. Add a default constructor, an initialization constructor, and a copy constructor to your classes 4. Add a toString0 method to each class. 5. Every time a meeting object is created, the number of meetings is incremented (use a static method to increment the static data member numberOfMeetings). 6. Add a test class to a. Create three meeting (say ml, m2 and m3) for a specific date in a specific place, and with a specific topic. Take your input from the user using s Scanner. b. Create another meeting m4, which is a shallow copy of ml. c. Create another meeting m5, which is a deep copy of ml d. Display all created meetings. e. Display the number of meetings created f. Change the date of one of the meetings (say ml) g. Change the place of another meeting (say m2). h. Change the topic of the third meeting (say m3). i. Display all the meetings again. j. Save all your meetings to an output file. Call it "meetingdata.txt

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Guide To Client Server Databases

Authors: Joe Salemi

2nd Edition

1562763105, 978-1562763107

Students also viewed these Databases questions

Question

Complexity of linear search is O ( n ) . Your answer: True False

Answered: 1 week ago