Michael T. Goodrich
Hopkins e-mail: goodrich@jhu.edu
Brown e-mail: mtg@cs.brown.edu
http://www.cs.jhu.edu/~goodrich
Electronic office hours (or make an appointment to see me anytime)
An undergraduate-level algorithms course or equivalent.
This course will focus on topics of algorithms and data structures for advanced problems whose primary motivation comes from the Internet and Internet applications. The paradigms of asymptotic analysis, competitive analysis, and algorithm engineering will be applied to the design and analysis of methods for such topics as the following:
The course grade is determined by the total number of points earned by the student during the semester. There are 1000 points possible, distributed as follows:
Late policy: 10% off the original score for each day late.
See the course web site (http://www.cs.jhu.edu/~goodrich/teach/internet/ ) for course notes and news, which will be ``under construction'' throughout the semester.
Copyright © 2000 Michael T. Goodrich, as to this syllabus and all lectures. Students are prohibited from selling (or being paid for taking) notes during this course to or by any person or commercial firm without the express written permission of the professor teaching this course.