Tutorial Questions

Links with tutorial questions will be enabled as the course progresses.
• Tutorial Handouts
  

  These will be added throughout the term.

• Tutorial Time and Locations
  

  TUT 101 - MC 4041: 10:30am - 11:20am (Friday)
  

• Tutorial Solutions
  

  protected-file area on this web page

  Tutorial	Date	Topics	Files
  Tutorial 0	Asynchronous	LaTeX	Please see LEARN.
  Tutorial 1	May 15	Asymptotic notation	t01.pdf
  Tutorial 2	May 22	Priority queues	t02.pdf
  Tutorial 3	May 29	Randomized analysis, Average-case analysis, Sorting	t03.pdf
  Tutorial 4	June 5	BSTs, AVL tree and Scapegoat tree practice, vEB trees (if time allows)	t04.pdf
  Tutorial 5	June 12	Static/Dynamic Ordering, Skip Lists, Fibonacci Heaps, Amortized Analysis	t05.pdf
  Tutorial 6	June 19	(Extension) SegTrees, Sqrt Decomposition, Mo's Algorithm, vEB Trees (delayed), Number-theoretic Algorithms	t06.pdf
  Midterm Review	June 19, 4:30-6:30 in MC4064		midhelp.pdf
  Tutorial 7	June 26	Interpolation Search, Splay Trees, Tries	t07.pdf
  Tutorial 8	July 3	Problems on tries, hashing	t08.pdf
  Tutorial 9	July 10	Range search, (Extension) geometry algorithms	t09.pdf
  Tutorial 10	July 17
  Tutorial 11	July 24
  Tutorial 12	July 31

Tutorial Solutions

Partial tutorial solutions may be available in the protected area.