Computer Science 577: Introduction to Algorithms

This course presents a survey of important and useful algorithms for sorting, searching, pattern-matching, graph manipulation, geometry, and cryptography. Paradigms for algorithm design. Techniques for efficient implementation. Here is a tentative list of topics (html) that will be covered in the course. Prereq: CS 367, Math 222, and CS 240, or consent of instructor.

Browser Warning:

It has been observed recently that some versions of IE display commented out sections of the web page. So if you're seeing stuff that looks like being from an earlier offering of the course or simply weird, try using Firefox or some other web browser.

Time & Place:

Instructors:

Professor Deborah Joseph

Teaching Assistant:

Teaching Assistant:

Textbook:

The Textbook      
The Design & Analysis of Algorithms,
Anany Levitin, Addison-Wesley, 2003.
ISBN 0-201-74395-7.

What's happening in class: Non-honors section       Honors section

Course Handouts and Links:

Both Sections:

Honors section only:

Non-Honors section only:

Grading Scale (excluding exams):

A 290 or more points
 AB  255 - 289 points
B 220 - 254 points
 BC  185 - 219 points
C 150 - 184 points
D 100 - 149 points
F below 100 points

Homework assignments: Non-Honors Section      Honors Section

Homework assignments should be done individually. You may discuss the homework problems with your class mates and with other University of Wisconsin computer science students, but you must write-up the answers on your own. This means that while you may give an answer that is similar to that of another student, we would find it very surprising to receive two nearly identical solutions.

Consulting the web for solutions is not allowed, unless the problem tells you to.

Also, please do not discuss the homework assignments over the Web, or with students in other universities.

Projects: Non-honors Section