Tutorial Notes
- Spring 2023 Tutorial Handouts
-
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 (Order Notations and Runtime Analysis)
tut02.pdf -
Tutorial 03 (Heaps)
tut03.pdf -
Tutorial 04 (Heaps, Average Runtime Analysis)
tut04.pdf
-
Tutorial 05 (Expected Runtime, QuickSelect)
tut05.pdf -
Tutorial 06 (Radix-sort)
tut06.pdf -
Tutorial 07 (AVL Tree)
tut07.pdf -
Tutorial 08 (Interpolation Search, Dynamic Ordering, SkipList)
tut08.pdf -
Tutorial 09 (Trie and Hashing)
tut09.pdf
-
Tutorial 10 (Quadtree)
tut10.pdf -
Tutorial 11 (Range Tree and String Comparisons)
tut11.pdf - 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.
-
Tutorial 00 (LaTeX and Assignment 0)