Tutorial Notes

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

  Tutorial 1:

  Asymptotic Analysis and Heaps

  Tutorial 2:

  Recurrences, Sorting, and Binomial Heaps

  Tutorial 3:

  AVL Trees

  Tutorial 4:

  Amortized Analysis and Skip Lists

  Tutorial 5:

  Splay Trees, MTF, Interpolation Search

  Tutorial 6:

  Tries, Hashing

  Tutorial 7:

  More Hashing, Quad-trees

  Midterm Supplemental Problems:

  midpractice.pdf

  Tutorial 8:

  KD-Trees, Range Search

  Tutorial 9:

  Range Trees, 3-sided Range Search

  Tutorial 10:

  KMP, Boyer Moore

  Tutorial 11:

  Huffman Encoding, RLE, LZW

  Tutorial 12:

  BWT, 2-4 Trees, red-black trees

  Tutorial 13:

  Extendible Hashing, B 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 the link below, you agree to the following statements:

• I am a student in CS 240e 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.
Click here to view solutions