Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Please help!! Talk Scheduling (70 points) Imagine you are a conference organizer and you are tasked with scheduling the largest possible subset from a set

image text in transcribedimage text in transcribedPlease help!!

Talk Scheduling (70 points) Imagine you are a conference organizer and you are tasked with scheduling the largest possible subset from a set of talks all in the same room. Each talk in the set has a given start time and end time. These times cannot change. No talks that have times that overlap can be scheduled in the same room. For the sake of this assignment assume that one talk can begin instantly upon completion of the previous talk. Consider the example below with three talks in the set: Talks: 1. Fred Flinstone 9:00AM-11AM 2. Barney Rubble 10:30AM-4PM 3. Bam Bam Rubble 1PM-1:15PM The optimal schedule (the one that schedules the most talks) in this example would be to schedule Fred's talk and Bam Bam's talk. Note: Optimal does NOT mean the room is used for the longest time, it means the greatest possible number of talks are scheduled This Assignment Step 1: Come up with an algorithm that will lead to scheduling the greatest number of talks. Step 2: Implement your algorithm in Java using the design outline below. Included on Codio is a file containing a list of 50 talks along with their start and end times. I used a 24 hour time format to make this a little easier. Your application must read a file in this format and schedule the maximium number of talks that can be scheduled in a single room. To do this write the following two classes: 1. Talk.java- This class is used to model a talk and may be used to provide the title and/or speaker for a talk along with the start and stop times of the talk. This class should implement the Comparable interface 2. Scheduler.java - This class will serve as a repository for static methods that you will use to schedule the talks. Included on Codio is a test class, ScheduleTest.java. Your code must work with our tester For the aspiring hacker (not for credit) Write a separate application (you may use some of the classes above) to schedule ALL of the talks in the minimum number of rooms. What to hand in The test file ScheduleTest.java is already located on Codio. You must create files: Talk.java and Scheduler.java as described above and add them to your Assignment 5 Unit on Codio. In addition to the source files include a text file named readMe.txt with an explanation of how your program works. That is, write in plain English, instructions for using your software, explanations for how and why you chose to design your code the way you did. The readMe.bxt file is also an opportunity for you to get partial credit when certain requirements of the assignment are not met

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

Step: 3

blur-text-image

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

More Books

Students also viewed these Databases questions