Syllabus for Test2

  1. Running time of an algorithm.
  2. Best, worst and average case complexity of algorithms.
  3. Comparison of running times of different algorithms.
  4. Exact analyis of algorithms
  5. Insertion sort in detail
  6. Growth of functions
  7. Oh notation
  8. Theta notation
  9. Omega notation
  10. Theorem 1, 2, 3 and 4
  11. Bubble sort in detail
  12. Horner's rule
  13. Fibonacci sequence
  14. Properties of asymptotic notations