Prerequisites by Topic

• Significant experience programming in some high-level programming
  language
• Familiarity with standard data structures: lists, stacks, queues,
  trees, search trees, priority queues, hash tables, graphs
• Understanding of asymptotic notation and its use in analyzing
  algorithms
• Understanding of basic concepts of set theory and propositional
  and predicate logic
• Ability to write rigorous proofs
• Understanding of algebra (functions, solution of equations,
  limits, summations), calculus (derivatives and integrals), and
  combinatorics

Knowledge and Skills Acquired

• Mastery of:
  • The design of efficient algorithms
  • Mathematical analysis of algorithms
  • Mathematical rigor in solving theoretical problems
  • Written communication of rigorous problem solutions
• Familiarity with:
  • NP-completeness and related topics