Tutorial Notes
- Spring 2022 Tutorial Handouts
These will be added throughout the term.
-
Tutorial 00 (LaTeX and Assignment 0)
tut00.pdf tut00.tex
tut00sol.pdf tut00sol.tex -
Tutorial 01 (Asymptotic Analysis and Runtime Analysis)
tut01.pdf -
Tutorial 02 (Heaps and Sorting)
tut02.pdf -
Tutorial 03 (Sorting, Expected Runtime Analysis, Average Case Analysis)
tut03.pdf -
Tutorial 04 (Expected Runtime Analysis, Non-Comparison Sorting)
tut04.pdf
-
Tutorial 05 (AVL Trees and Skip Lists)
tut05.pdf -
Tutorial 06 (Interpolation Search and Tries)
tut06.pdf -
Tutorial 07 (Hashing)
tut07.pdf -
Tutorial 08 (Hashing, Quadtrees, and KD-Trees)
tut08.pdf -
Tutorial 09 (Range Trees)
tut09.pdf -
Tutorial 10 (KMP, Suffix Trie/Array)
tut10.pdf -
Tutorial 11 (LZW Encoding and Burrows-Wheeler Transforms)
tut11.pdf
-
Tutorial 00 (LaTeX and Assignment 0)
- Midterm Help Session
midpractice.pdf - Final Help Session
finalpractice.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.