CSE 431/531: Algorithms Analysis and Design
Fall 2002
Time: MWF 09:00am--09:50am, Place: Knox 14
Instructor: Prof. Hung Q. Ngo Office: 239 Bell Hall
Office Hours: Thursdays 1:00-3:00pm Phone: 645-3180 x 160
Email: hungngo@cse.buffalo.edu Teaching Assistants: (in random order) Mr. Yang Chen Office: Trailer B8 Office Hours: Mondays 2:00-4:00pm Email: yangchen@cse.buffalo.edu Recitations: B3, Fridays, 10:00-10:50, 422 FRNCZK Mr. Guang Xu Office: Trailer E12 Office Hours: Tuesdays 3:00-5:00pm Email: guangxu@cse.buffalo.edu Recitations: B2, Thursdays, 15:30-16:20, 209 Norton. B1, Mondays, 12:00-12:50, 250 Park.
Course Description:
This course introduces basic elements of the design and analysis of computer algorithms. Topics include asymptotic notations and analysis, parallel sorting networks, divide and conquer, greedy methods and matroids, dynamic programming, basic graph algorithms, NP-completeness, approximation algorithms, and network flows analysis. For each topic, beside in-depth coverage, one or more representative problems and their algorithms shall be discussed.
In addition to the design and analysis of algorithms, students are expected to gain substantial discrete mathematics problem solving skills essential for computer engineers.
Course Objectives:
Prerequisites:
Data Structures (CSE250), Calculus II, and a course that requires formal proofs.
The desire and ability to learn new ideas quickly.
At the end of this course, each student should be able to:
References:
Class homepage:
http://www.cse.buffalo.edu/~hungngo/classes/cse531_fall02/
Work load:
Grading policy:
Academic Honesty:
Misc. Items: