TCSS 342, Autumn 2012

Instructor: Donald Chinn
Class time/place: MW 1:30-3:35pm, JOY 109

Handouts

1. Course syllabus and lecture schedule
2. Assumptions that guide this course
3. Guide to Proof by Induction

Extra Materials

1. Algorithm analysis exercises (from lecture)

2. Proof by induction exercises (from lecture)

3. Additional big-Oh and induction exercises

4. Additional BST exercises

5. Document on removing a node from an AVL tree

6. Splay tree, hash tables, binary heap exercises

7. Binomial queues Binomial queues (pdf)

Lectures

Assignments

• Homework #1 (due Monday, October 1)
• Homework #2 (due Monday, October 8)
• Homework #3 (due Monday, October 15) Homework #3 (pdf – there is a summation you can see here that does not show up in the html file)
• Homework #4 (due Wednesday, October 24)
• Homework #5 (due Wednesday, October 31) Homework #5 (pdf – there is a graph you can see here that might not show up in the html file)
• Homework #6A (due Wednesday, November 14) Homework #6A (pdf – some of the graphics might not show up in the .docx file) [problems 1 and 2 will help you study for Midterm 2]
• Homework #6B (due Wednesday, November 28, demos during the week of December 3-5) possibly useful code for hw #6B
• Homework #7 (due Wednesday, December 5)

Exams

Exam & Midterm information