Syllabus for Test1

  1. What is an algorithm?
  2. What are the desired characteristics of an algorithm?
  3. What is analyzing an algorithm?
  4. Data structure vs. ADT
  5. Mathematical Induction
  6. Series summations (arithmetic, geometric, harmonic, mixed)
  7. Common functions (logarithm, floor, ceiling, mod, factorial)
  8. Monoticity
  9. Infinite geometric series
  10. Telescoping series
  11. Products
  12. Techniques for bounding summations (bounding the terms, splitting summations)
  13. Approximation by integrals
  14. Set theory (definition of a set, subset, set cardinality, set notation, set operations, relations)