Tutorial Notes
The tutorial on January 8 is asynchronous. Please see LEARN.
- Winter 2024 Tutorial Handouts
These will be added throughout the term.
Tutorial Topics Files Tutorial 0 (asynchornous) LaTeX Please see LEARN. Tutorial 1 Asymptotic analysis t01.pdf
t01_master.pdfTutorial 2 Priority queues, binary lifting, convexity t02.pdf Tutorial 3 Average-case vs expected, amortization, sorting lower bound, more practice t03.pdf Tutorial 4 Amortized analysis (stars, binary counter, other examples), balanced trees t04.pdf Tutorial 5 Fibonacci heaps, dynamic/static orderings, scapegoat trees t05.pdf Midterm Review Please see piazza @93. Tutorial 6 van Emde Boas, MT review t06.pdf Tutorial 7 Prime numbers t07.pdf Tutorial 8 Hashing with probing implementation Please see LEARN for code and recording. Tutorial 9 Range searches t09.pdf Tutorial 10 Pattern matching t10.pdf Tutorial 11 Details of FFT/DFT Final Review
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.