CSE 830:
Design and Theory of Algorithms

Spring 2008

Instructor: Dr. Charles A. Ofria
Office: 2140 Engineering
Phone: 355-8389
E-mail: ofria@cse.msu.edu
Textbook: Introduction to Algorithms, Second Edition by Cormen, Leiserson, Rivest, and Stein, McGraw Hill, 2001 ISBN 0-07-013151-1
Meeting time & Room: M/W 3pm-4:20pm, 315 Ernst Bessy Hall
Office Hours: Mondays 10-11am and by appointment.
Pre-reqs: Knowledge of at least one major programming language, basic data structures, and recursion.
Web page: http://www.cse.msu.edu/cse830/

Description: Analysis of algorithms. Algorithm design techniques. Efficient algorithms for classical problems. Intractable problems and techniques to handle them.

Handouts

  • Basic Info
  • Schedule
  • Sample Exam I
  • Sample Exam II
  • Sample Final
  • Homwork

  • Homework 1
  • Homework 2
  • Homework 3
  • Homework 4
  • Project
  • Homework 5
  • Lectures

  • Week 1 - Introduction and Tools
  • Lecture 2 - Recurrence Relations (Dr. Torng)
  • Lecture 3 - Data Structures (Dr. Torng)
  • Lecture 4 - Introduction to Sorting (Dr. Torng)
  • Lecture 5 - Quicksort!

  • Week 5 - Dynamic Programming (Feb 4, 2008)
  • Week 6 - Optimization Problems (Feb 11, 2008)
  • Weeks 8 and 9 - Graph Theory (Feb 25 & Mar 10, 2008)
  • Week 10 - Approximization Techniques / Bit Magic! (Mar 17, 2008)
  • Week 13 - Introduction to NP-Completeness (Apr 7, 2008)
  • Week 14 - NP-Completeness Proofs (Mar 14, 2008)