Binary search trees (BSTs) - A BST is a data structure used to organize and efficiently access data. These notes discuss the structure of a BST, searching in a BST, and rotations in a BST. | ||
Signal Filtering - A signal can be modified by passing it through a filter. Filters can smooth the signal, enhance sharp changes, find local maxima, and so on. | ||
Root Finding - A zero or "root" of a function is a value z such that f(z) = 0. These notes demonstrate several root-finding methods. | ||
Spline curves - Splines are used in Computer Aided Design to model curves and surfaces, particularly in designing cars. This is a preliminary version of the applet and doesn't yet have many features or much documentation. |
Up to James Stewart's home page.