Library Home || Full Table of Contents || Suggest a Link || Library Help
|Ian Craw and John Pulham; University of Aberdeen|
|Lecture notes, tutorial sheets, exams, and other material provided for a course on algorithms with the objective of exposing the student to a small number of typical methods from a range of different contexts, so as to reveal the type of thinking that is involved and give students the basic hints as to how to proceed with individual problems. Applications include sorting algorithms, searching algorithms, string processing and language, geometric algorithms, graph algorithms, and mathematical algorithms. Individual topics include hatching convex polygons; recursion; optimal sorting; optimal merging; heapsort; grammars and parsing; abstract data types such as the ADT priority queue, traversals, binary trees, and Huffman codes; random shuffles; the Fast Fourier Transform (FFT) and its applications, such as image processing (Gaussian Blur and the Laplace Operator); and Big O timing formulas. Available online as well as in PDF format.|
|Levels:||High School (9-12), College|
|Resource Types:||Course Notes, Problems/Puzzles, Tutorials|
© 1994- Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.