Computer
Science and Engineering SUNY at Buffalo |
CSE 531: Design and Analysis of Algorithms
Instructor: Hung
Q. Ngo |
Fall 2007
Tue Thu,
1100-1220, |
Teaching Staff | Contact and Administrative Information |
Hung Q. Ngo (instructor) |
Office: 238 Bell Hall |
Mr. Yang Wang (teaching assistant) |
Office: Trailer B14 |
Ms. Thanh-Nhan Nguyen (teaching assistant) |
Office: Trailer E17 |
Course Description:
This course introduces basic tools and techniques for the design and analysis of computer algorithms. Topics include asymptotic notations and analysis, greedy algorithms, divide and conquer, dynamic programming, network flows, NP-completeness, linear programming, approximation algorithms, and randomized algorithms. For each topic, many 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 and scientists.
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:
Course homepage:
http://www.cse.buffalo.edu/~hungngo/classes/2007/Fall-531/
Course's blog: (for latest announcements and discussions -- you should subscribe to its RSS feed)
http://ubcse531.wordpress.com/
Work load:
Grading policy:
Academic Honesty:
Misc. Items: