This preview shows pages 1–2. Sign up to view the full content.
CS 473
Homework 6.5 (Practice only)
Spring 2010
•
This homework is optional.
If you choose to submit solutions, we will provide feedback. Choosing
to submit or not submit this homework will have no effect on your overall homework grade.
1. After a grueling algorithms midterm, you decide to take the bus home. Since you planned ahead,
you have a schedule that lists the times and locations of every stop of every bus in Champaign
Urbana. Unfortunately, there isn’t a single bus that visits both your exam building and your home;
you must transfer between bus lines at least once.
Describe and analyze an algorithm to determine the sequence of bus rides that will get you
home as early as possible, assuming there are
b
different bus lines, and each bus stops
n
times per
day. Your goal is to minimize your
arrival time
, not the time you actually spend traveling. Assume
that the buses run exactly on schedule, that you have an accurate watch, and that you are too
tired to walk between bus stops.
2. Describe an algorithm to compute the minimum spanning tree of an
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview. Sign up
to
access the rest of the document.
 Spring '08
 Chekuri,C
 Algorithms

Click to edit the document details