| |
| | LMU Computer Science: Courses (Site not responding. Last check: 2007-10-25) |
 | | A study of the philosophical and epistemological roots of computer science. |
 | | Introduction to the study of computational complexity, including efficient algorithms for matrix multiplication and fast Fourier transforms, the classes P and NP, approximation algorithms, randomized algorithms and RP, parallel algorithms and NC. |
 | | Topics in the theory and design of compilers and interpreters for high-level programming languages, including scanners and scanner-generators, contextfree grammars and pushdown automata, parser construction, code generation, syntax-directed translation, error analyzers and recovery, and optimization and data-flow analysis. |
| cse.lmu.edu /computerscience/coursewebpages.shtml (865 words) |
|