Consider the generalization of the rickety bridge crossing puzzle in which we have n > 1 people whose bridge crossing times are t₁, t2, ..., tn. You may assume that t₁ ≤ t₂ ≤ ... ≤ tŋ. All the other conditions of the problem remain the same: all begin on the same side of the bridge, at most two people at the time can cross the bridge (and they move with the speed of the slower of the two) and they must carry with them the only flashlight the group has. Design a greedy algorithm for this problem and find how long it will take to cross the bridge by using this algorithm. Find an instance with the smallest number of people for which your greedy algorithm does not yield a minimum crossing time.

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...
icon
Related questions
Question

PLEASE answer ASAP, thanks

Using the greedy approach

i will give likes if you answer as soon as possible

Consider the generalization of the rickety bridge crossing puzzle in which we
have n > 1 people whose bridge crossing times are t₁, t2, ..., tn. You may assume that t₁ ≤ t₂
< ... < tn. All the other conditions of the problem remain the same: all begin on the same
side of the bridge, at most two people at the time can cross the bridge (and they move
with the speed of the slower of the two) and they must carry with them the only flashlight
the group has.
Design a greedy algorithm for this problem and find how long it will take to cross the
bridge by using this algorithm. Find an instance with the smallest number of people for
which your greedy algorithm does not yield a minimum crossing time.
Transcribed Image Text:Consider the generalization of the rickety bridge crossing puzzle in which we have n > 1 people whose bridge crossing times are t₁, t2, ..., tn. You may assume that t₁ ≤ t₂ < ... < tn. All the other conditions of the problem remain the same: all begin on the same side of the bridge, at most two people at the time can cross the bridge (and they move with the speed of the slower of the two) and they must carry with them the only flashlight the group has. Design a greedy algorithm for this problem and find how long it will take to cross the bridge by using this algorithm. Find an instance with the smallest number of people for which your greedy algorithm does not yield a minimum crossing time.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

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