CSC 225 Class Notes: Fall 2017

For a complete set of notes, please attend class or get notes from someone who attended. Only selected notes will be placed here.

  1. Lecture 1: Introduction to CSC 225.
  2. Review of Linked Lists
  3. Review of Induction
  4. Recursive algorithm for reversing a linked list.
  5. Solving recurrence relations.
  6. Some programming hints and more on recurrences/induction
  7. Mathematics for Algorithm Analysis
  8. MaxSort
  9. Loop invariants
  10. MergeSort
  11. QuickSort
  12. Assignment 1A: Hints for writing good programs.
  13. Algorithm analysis and binary search
  14. Space complexity of algorithms
  15. A bad big Oh proof.
  16. HeapSort
  17. Binary Trees
  18. Radix Sort
  19. Introduction to graph theory
  20. Kruskal's algorithm for the Minimum Weight Spanning Tree Problem
  21. An example for Kruskal's algorithm
  22. Drawing decision trees for the diver watch problem
  23. A lower bound for the time for comparison model sorting algorithms
  24. Union/Find approach to maintaining connected component information
  25. BFS (Breadth First Search)
  26. DFS (Depth First Search)
  27. Assignment #5 example
  28. Hashing
  29. More on BFS/DFS, the sorting lower bound and hashing.
  30. Space complexity.
CSC 225 Notes / maintained by Wendy Myrvold / wendym@cs.UVic.ca / revised Nov. 30, 2017