TCSS 342B, Autumn 2004
Mathematical Principles of Computing I Be sure to check out the supplemental book material; it includes all code examples from the book as well as a list of errors that are in the book. Look here for a directory listing of all slides and notes. Week 1 Notes
The (revised) in-class worksheet. (Includes additional problems!)
The answers to the revised in-class worksheet, courtesy of Marty Stepp. Due to a lack of equation editor at home, these answers use SUM instead of summation notation with the capital Sigma character. slides for course overview and review of math.. Week 2 Notes
In class analysis worksheet.
Slides explaining big-Oh and simple algorithm analysis. Slides explaining Collections and the Bag ADT. Solution to the previous in-class worksheet. Week 3 Notes
Slides about Lists, Stacks, and Queues.
Link to java packages tutorial. Slides about Recursion and Induction, and other proof techniques.Week 4 and 5 Notes
Week 6 Notes
Week 7 Notes
Week 8 Notes
A java applet showing the behaviour of binary trees and balanced binary trees. (shown last week).
Practice binary trees handout. We will be finishing up the slides from last week. Slides on the proving the height of AVL trees. Slides about red-black trees have been updated. Slides about hashing. Week 9 Notes
Hashing practice
handout
Week 10 Notes
|
||
Send mail to:
Contact Email
Last modified: 12/01/2004 2:58 PM |