Tutorial notes
 Winter 2023 Tutorial Handouts
These will be added throughout the term.

Tutorial 00
Tut00: Latex and A00: tut00_latex.pdf tut00_latex.tex tut00_latex_sol.pdf tut00_latex_sol.tex
 Tutorial 01 Tut01: Asymptotic Analysis: tut01.pdf
 Tutorial 02:Recurrences, trees, amortized analysis tut02.pdf
 Tutorial 03: Amortized, expected, and averagecase analyses; sorting tut03.pdf
 Tutorial 04: Amortized analysis & dictionaries: tut04.pdf

Tutorial 05:
Examples, potential function method: tut05.pdf
 Tutorial 06: Generating functions, orderings, selection and ordered sets: tut06.pdf
 Tutorial 07: Splay trees analysis, midterm takeup, selection with binary indexed tree.
 Tutorial 08: Interpolation search, bisection method, ternary search: tut08.pdf
 Tutorial 09: CarterWegman's hashing, number theoretic algorithms, more problems on hashing and tries tut09.pdf
 Tutorial 10: 3sided range search, the goodsuffix heuristic, and problems on rangesearch and on string matching tut10.pdf
 Tutorial 11: Polynomial multiplication with FFT, problems on compression tut11.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 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.

Tutorial 00