CS463 Algorithms

Spring 2006

(this syllabus is subject to change)


Introductory information:

Course Description and/or Course Objectives

  • Introduction to algorithm analysis
  • Growth of functions
  • Recurrence
  • Sorting in linear time
  • Selection
  • Enhancing Data Structures
  • Red-black trees
  • Dynamic programming
  • Greedy algorithm
  • Amortized analysis
  • Linear Programming
  • Polynomials and FFT
  • NP-Completeness
  • Miscellaneous Information

    This class will use Oncourse. You can login Oncourse using your IUPUI account.