Problem Description Suppose that you are scheduling a room. You are given a group of activities each of which has a start and stop time. Two activities are compatible if they do not overlap (one activity finishes before another one starts). For example, in the following activities, activity A is compatible with activities B and D but not activity C: Activity Start Time Stop time A 1 2. B 2 5 1 3 D 6 The room has a start time and an end time in which it is available. Your goal is to write a recursive method to schedule compatible activities that result in the maximum usage of the room. The usage of the room is defined as the total duration of the scheduled activities, that is, the sum of (stop time - start time) for all the activities scheduled to run in the room. For example suppose that the start time and end time in which the room is available is (1,7] for the above table. Hence, the possible schedules are: 1. Activities A, B,D: with room usage = (2-1)+(5-2) +(6-5) = 5 2. Activities C, D: with room usage = (3-1)+(6-5) = 2 3. Activities A,D: with room usage (5-2)+(6-5) =4 4. Activities A, B: with room usage (2-1)+(5-2)= 4 5. Activities B, D: with room usage (5-2)+(6-5) = 4 Therefore, the set of activities (A,B,D} gives the optimal schedule with the maximum room usage.
Problem Description Suppose that you are scheduling a room. You are given a group of activities each of which has a start and stop time. Two activities are compatible if they do not overlap (one activity finishes before another one starts). For example, in the following activities, activity A is compatible with activities B and D but not activity C: Activity Start Time Stop time A 1 2. B 2 5 1 3 D 6 The room has a start time and an end time in which it is available. Your goal is to write a recursive method to schedule compatible activities that result in the maximum usage of the room. The usage of the room is defined as the total duration of the scheduled activities, that is, the sum of (stop time - start time) for all the activities scheduled to run in the room. For example suppose that the start time and end time in which the room is available is (1,7] for the above table. Hence, the possible schedules are: 1. Activities A, B,D: with room usage = (2-1)+(5-2) +(6-5) = 5 2. Activities C, D: with room usage = (3-1)+(6-5) = 2 3. Activities A,D: with room usage (5-2)+(6-5) =4 4. Activities A, B: with room usage (2-1)+(5-2)= 4 5. Activities B, D: with room usage (5-2)+(6-5) = 4 Therefore, the set of activities (A,B,D} gives the optimal schedule with the maximum room usage.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
![What you need to do:
1- Create a class Activitiy.java with three data fields : activityName, startTime, and stopTime.
Create accessor (get) and mutator (set) methods for each data field.
2- Create a class Scheduling.java with the following method in it:
public Activity[ getOptimalSchedule( int roomStartTime, int roomEndtime,
Activity[] activities)
This method gets the availability span of the room as well as a set of activities to choose from and
returns an optimal schedule i.e., a selected set of non-overlapping activities that can be scheduled to
run in the room and gives the maximum possible usage of the room. Note, depending on your input,
the correct answer may not be unique (that is, there might be several valid schedules with the same
total room usage)
Note: it is important that your getOptimalSchedule method has the signature above for ease of testing
and grading. Also you can use any additional utility methods in your classes as long as you provide
comments explaining what each utility method does.
What you need to turn in:
You need to submit your two java files : Activity.java and Scheduling.java](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fdde37499-4162-4f47-8543-95accdc3d87c%2F847c4142-052e-4b84-9058-91dc6dfeab4d%2Ft28bi4_processed.jpeg&w=3840&q=75)
Transcribed Image Text:What you need to do:
1- Create a class Activitiy.java with three data fields : activityName, startTime, and stopTime.
Create accessor (get) and mutator (set) methods for each data field.
2- Create a class Scheduling.java with the following method in it:
public Activity[ getOptimalSchedule( int roomStartTime, int roomEndtime,
Activity[] activities)
This method gets the availability span of the room as well as a set of activities to choose from and
returns an optimal schedule i.e., a selected set of non-overlapping activities that can be scheduled to
run in the room and gives the maximum possible usage of the room. Note, depending on your input,
the correct answer may not be unique (that is, there might be several valid schedules with the same
total room usage)
Note: it is important that your getOptimalSchedule method has the signature above for ease of testing
and grading. Also you can use any additional utility methods in your classes as long as you provide
comments explaining what each utility method does.
What you need to turn in:
You need to submit your two java files : Activity.java and Scheduling.java
![Problem Description
Suppose that you are scheduling a room. You are given a group of activities each of which has a start
and stop time. Two activities are compatible if they do not overlap (one activity finishes before another
one starts). For example, in the following activities, activity A is compatible with activities B and D but
not activity C:
Activity Start Time Stop time
A
1
2
B
2
1
B.
The room has a start time and an end time in which it is available.
Your goal is to write a recursive method to schedule compatible activities that result in the maximum
usage of the room. The usage of the room is defined as the total duration of the scheduled activities,
that is, the sum of (stop time - start time) for all the activities scheduled to run in the room.
For example suppose that the start time and end time in which the room is available is [1,7] for the
above table. Hence, the possible schedules are:
1. Activities A, B,D: with room usage = (2-1)+(5-2) +(6-5) = 5
%3D
2. Activities C, D: with room usage = (3-1)+(6-5) = 2
%3D
3. Activities A,D: with room usage (5-2)+(6-5) =4
4. Activities A, B: with room usage (2-1)+(5-2)= 4
5. Activities B, D: with room usage (5-2)+(6-5) = 4
Therefore, the set of activities {A,B,D} gives the optimal schedule with the maximum room usage.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fdde37499-4162-4f47-8543-95accdc3d87c%2F847c4142-052e-4b84-9058-91dc6dfeab4d%2F229lulr_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Problem Description
Suppose that you are scheduling a room. You are given a group of activities each of which has a start
and stop time. Two activities are compatible if they do not overlap (one activity finishes before another
one starts). For example, in the following activities, activity A is compatible with activities B and D but
not activity C:
Activity Start Time Stop time
A
1
2
B
2
1
B.
The room has a start time and an end time in which it is available.
Your goal is to write a recursive method to schedule compatible activities that result in the maximum
usage of the room. The usage of the room is defined as the total duration of the scheduled activities,
that is, the sum of (stop time - start time) for all the activities scheduled to run in the room.
For example suppose that the start time and end time in which the room is available is [1,7] for the
above table. Hence, the possible schedules are:
1. Activities A, B,D: with room usage = (2-1)+(5-2) +(6-5) = 5
%3D
2. Activities C, D: with room usage = (3-1)+(6-5) = 2
%3D
3. Activities A,D: with room usage (5-2)+(6-5) =4
4. Activities A, B: with room usage (2-1)+(5-2)= 4
5. Activities B, D: with room usage (5-2)+(6-5) = 4
Therefore, the set of activities {A,B,D} gives the optimal schedule with the maximum room usage.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 4 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY