CSE 373: Lecture Slides (Winter 2001)
Various slides will be made available throughout the quarter.
Mathematical Background (sets, relations, functions)
The material covered on January 8 (in particular the OnOffApplet program) is accessible from the Syllabus page.
The material covered on January 10 (in particular the TextTestApplet program) is accessible from the Syllabus page.
The material for January 12 (in particular the LineApplet program) is accessible from the Syllabus page.
Aspects of Java's Abstract Windowing Toolkit
Permutations program example: Perm.java
Review of Asymptotic analysis + Performance Measurement
Selection sort and class VisibleDataStructure program example: SelectionSort applet
Linear Lists (Adam Carlson)
The UNION-FIND Abstract Data Type
Bin Sort, Radix Sort, Sparse Arrays, Stack-based Depth-First Search
Binary Search Trees, including AVL Search Trees
Dynamic Programming and the 0/1 Knapsack Problem - by J.C. Wu (View with IE only).
Up-Trees, Fast UNION-FIND Operations, and Minimum Spanning Trees