CSE 241 or consent.
Textbooks
Cormen, Leiserson, Rivest, and Stein,
Introduction to Algorithms, 2nd edition,
Robert E. Tarjan, Data Structures and Network Algorithms, and
selected papers.
Time/place
2:30 to 4:00 PM, Tuesdays and Thursdays
Sever 102
Grades
The grade will be based on programming and homework
assignments, three exams, and a comprehensive final exam. There is an
optional final project. If you choose to do a project, your grade on
the project will replace your lowest grade on any of the three
in-class exams (assuming the project grade is better than the lowest
exam grade).
The distribution of grades will be as follows:
Assignments 30%
Exams 45%
Final 25%
Exam dates
Exam 1: Sept. 25, 2007
Exam 2: Oct. 23, 2007
Exam 3: Nov. 15, 2007
Final: 2:30 to 4:30 on December 18, 2007
Topics
Minimum Spanning Trees
Shortest Paths
Max Flow
Search Trees
Min Cost / Max Flow
Matching
Traveling Salesman Problem
Identifying Network Communities
Misc.
Assignments are due in class on the assigned date. Late assignments
will not be accepted, not even for partial credit. No
exceptions. If you are not going to be in class, you may turn in
your homework early by giving it to me in person, or by putting
it in my box in the CSE office after having it initialed by one
of the CSE department staff, with the date and time. Please use
this procedure only in exceptional circumstances.
Academic Integrity cover sheets must be submitted with each
assignment. These forms can be downloaded
here.
The syllabus can be downloaded here.
|
|
|
|
|
|
|