Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
You're helping to organize a mini-triathlon event: each of n contestants must first swim 20 laps of a pool, then bike 10 miles, then run 3 miles. The contestants must use the pool one at a time-that is, as soon as the first person is out of the pool, a second contestant can begin swimming the 20 laps-but many contestants may bike and run simultaneously. For each contestant i, you know the expected swimming time si, expected biking time b; and expected running time ri. Assume that all contestants need exactly their expected times to finish the three parts of the triathlon. You are tasked with sequencing the starts of the contestants so that the triathlon event ends as soon as possible. More formally, a schedule for the triathlon is an order in which to sequence the starts of the contestants. The completion time of a schedule is the earliest time at which all contestants will be finished. Given n triples (si, bi, r;), design an efficient algorithm that produces the schedule with the minimum completion time.

You're helping to organize a mini-triathlon event: each of n contestants must first swim 20 laps of a pool, then bike 10 miles, then run 3 miles. The contestants must use the pool one at a time-that is, as soon as the first person is out of the pool, a second contestant can begin swimming the 20 laps-but many contestants may bike and run simultaneously. For each contestant i, you know the expected swimming time si, expected biking time b; and expected running time ri. Assume that all contestants need exactly their expected times to finish the three parts of the triathlon. You are tasked with sequencing the starts of the contestants so that the triathlon event ends as soon as possible. More formally, a schedule for the triathlon is an order in which to sequence the starts of the contestants. The completion time of a schedule is the earliest time at which all contestants will be finished. Given n triples (si, bi, r;), design an efficient algorithm that produces the schedule with the minimum completion time.

Computer Networking: A Top-Down Approach (7th Edition)
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...
See similar textbooks
icon
Related questions
Question
Give me answer fast.
You're helping to organize a mini-triathlon event: each of n contestants must first swim 20 laps of a pool, then bike 10 miles, then run 3 miles. The contestants must use the pool one at a time–that is, as soon as the first persom is out of the pool, a second contestant can begin swimming the 20 laps-but many contestants may bike and run simultaneously. For each contestant i, you know the expected swimming time Si, expected biking time b; and expected running time r;. Assume that all contestants need exactly their expected times to finish the three parts of the triathlon. You are tasked with sequencing the starts of the contestants so that the triathlon event ends as soon as possible. More formally, a schedule for the triathlon is an order in which to sequence the starts of the contestants. The completion time of a schedule is the earliest time at which all contestants will be finished. Given n triples (si, b;, r;), design an efficient algorithm that produces the schedule with the minimum completion time.
Transcribed Image Text:You're helping to organize a mini-triathlon event: each of n contestants must first swim 20 laps of a pool, then bike 10 miles, then run 3 miles. The contestants must use the pool one at a time–that is, as soon as the first persom is out of the pool, a second contestant can begin swimming the 20 laps-but many contestants may bike and run simultaneously. For each contestant i, you know the expected swimming time Si, expected biking time b; and expected running time r;. Assume that all contestants need exactly their expected times to finish the three parts of the triathlon. You are tasked with sequencing the starts of the contestants so that the triathlon event ends as soon as possible. More formally, a schedule for the triathlon is an order in which to sequence the starts of the contestants. The completion time of a schedule is the earliest time at which all contestants will be finished. Given n triples (si, b;, r;), design an efficient algorithm that produces the schedule with the minimum completion time.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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 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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS