Syllabus for Test2

NOTE : The test is closed-text and closed-notes. You may bring the calculator if you want.

  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 (while loop inside for loop)
  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 (nested for loop scenario)
  12. Horner's rule (while loop involved)
  13. Little oh and little omega notations
  14. Properties of asymptotic notations (linearity, reflexivity, symmetry, transitivity, etc.)