Tutorial Notes
- Winter 2023 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 First Principles Proofs)
tut01.pdf -
Tutorial 02 (Runtime Analysis and Priority Queues)
tut02.pdf -
Tutorial 03 (Sorting, Expected Runtime Analysis, Average Case Analysis)
tut03.pdf -
Tutorial 04 (Quicksort, Sorting, Expected Runtime Analysis)
tut04.pdf
-
Tutorial 05 (AVL Trees and Non-Comparison-Based Sorting)
tut05.pdf -
Tutorial 06 (Skip Lists, Interpolation Search, and More Expected Runtime Analysis)
tut06.pdf -
Tutorial 07 (Hashing, Midterm Discussion)
tut07.pdf -
Tutorial 08 (Hashing, Quadtrees, and KD-Trees)
tut08.pdf -
Tutorial 09 (Range Trees, Karp-Rabin)
tut09.pdf
coding exercise -
Tutorial 10 (KMP, Boyer-Moore, Suffix Trees, Suffix Arrays)
tut10.pdf -
Tutorial 11 (Huffman Encoding, RLE, LZW)
tut11.pdf -
Tutorial 12 (LZW, BWT, 2-4 Trees)
tut12.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.