Office: 238 Bell Hall
Office Hours: Tue & Thu 9:30-10:30
Phone: 645-3180 x 160
Email: hungngo (at) cse (dot) buffalo (dot) edu

Office: Trailer B14
Office Hours: Fridays 1:30pm-3:30pm
Phone: TBA
Email: yw43 (at) buffalo (dot) edu
Recitation: R2 Wed 9:00-9:50 103 Talbert

Office: Trailer E17
Office Hours: Wednesdays 1:30pm-3:30pm
Phone: TBA
Email: nguyen9 (at) buffalo (dot) edu
Recitation: R1 Mon 8:00-8:50 214 Norton

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.

• Have fun learning!
• Grasp the essential ideas of algorithm analysis and design
  • asymptotic notations analysis
  • typical algorithm design methods: divide and conquer, greedy, dynamic programming, network flows, linear programming
  • basic graph algorithms: BFS, DFS, MST, ...
  • the notions of NP-completeness, approximation algorithms, and randomized algorithms
• Gain substantial problem solving skills in designing algorithms and discrete mathematics

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:

• Have a good overall picture of algorithm analysis and design techniques
• Solve simple to moderately difficult algorithmic problems arising from practical programming situations
• Understand the notions of NP-completeness and approximation algorithms
• Be able to demonstrate simple NP-complete problems
• Love designing and analyzing algorithms

References:

• Required Textbook:
  • Thomas H. Cormen, Charles E. Leiserson, Ronald Rivest, and Clifford Stein, Introduction to Algorithms (2e), 1180pp, ISBN: 0262032937, MIT Press, September 2001.
• Other references: (Helpful but not required)
  • Donald Knuth, The Art of Computer Programming Volumes 1, 2, 3, Addison Wesley.
  • Alfred V. Aho John E. Hopcroft Jeffrey Ullman, Data Structures and Algorithms, 427pp. ISBN: 0201000237, Addison Wesley, January 1983.
  • Jon Kleinberg, Éva Tardos, Algorithm Design, 864 pages, Addison Wesley, ISBN-10: 0321295358, ISBN-13: 978-0321295354, March 16, 2005.
  • Vijay Vazirani, Approximation Algorithms, Springer-Verlag, 397 pages hardcover, ISBN: 3-540-65367-8, published 2001.
  • Rajeev Motwani and Prabhakar Raghavan, Randomized Algorithms, 492 pages, Cambridge University Press (August 25, 1995), ISBN: 0521474655
  • Michael R. Garey and David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 338pp. ISBN: 0716710455, W. H. Freeman Company, November 1990.
    
• Plus other reading material specified on the course homepage

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:

• Heavy! So, start early!!
• Approx. 30 pages of fairly dense reading per week
• 6 written homework assignments (to be done individually)
• 1 midterm exam
• 1 final exam

Grading policy:

• 6 written assignments: 5% each (I reserve my right to add or reduce the number of assignments)
• Midterm: 30%
• Final: 40%
• Assignments due at the end of the lecture on the due date
  • 1 day (up to 24 hours) late: 20% reduction
  • Each extra (24 hours) day late: 40% reduction (which means you don't have to bother submit your assignment if it's more than 2 days late)
• Incomplete/make-up exams: NOT GIVEN, except in provably extraordinary cases

Academic Honesty:

• Please do the assignments on your own.
• No tolerance on plagiarism:
  • 0 on the particular assignment/exam for first attempt
  • Fail the course on the second
  • Consult the University Code of Conduct for details on consequences of academic misconduct
  • See also Prof. Shapiro's page on Academic Integrity of the CSE department: http://www.cse.buffalo.edu/~shapiro/Courses/integrity.html
• I will take cheating VERY VERY seriously. Don't waste your time begging !!

Misc. Items:

• Absolutely no lame excuses please, such as "I have to go home early, allow me to take the test on Dec 1", or "I had a fight with my girlfriend, which effects my performance", blah blah blah. Even when they are true, they are still lame.
• No extra work in the next semester given to improve your grade.