Tutorial Notes

• Videos to go with the handouts are on LEARN under Content.
  
  
• Winter 2021 Tutorial Handouts:
  

  Tutorial 0:

  A0 and Latex tut00.tex algo.sty

  Tutorial 1:

  Asymptotic Analysis

  Tutorial 2:

  Heaps

  Tutorial 3:

  Selection and Sorting

  Tutorial 4:

  Sorting and AVL Trees

  Tutorial 5:

  Skip Lists and Dynamic Ordering

  Midterm Help Session:

  midpractice.pdf

  Tutorial 6:

  Interpolation Search and Tries

  Tutorial 7:

  Hashing

  Tutorial 8:

  Quad Trees, KD-Trees, Range Trees, and Range Search

  Tutorial 9:

  String Matching

  Tutorial 10:

  Compression

  Tutorial 11:

  BWT

  Tutorial 12:

  2-4 trees

  Final Help Session:

  finalhelp.pdf
  
  

Tutorial Solutions

The solutions provided through this link are "protected", meaning that they are not to be shared. By clicking here, you agree to the following statements:

• I am a student in CS 240 in the current term.
• I will not share these files with anyone else, and I will delete all my copies of them at the end of the current term. It is my responsibility to ensure that no one else has access to these files.
• I agree to the collection of my userid, IP address, and the current time.