CSCI 3327 Algorithm Analysis and Design for Computational Scientists (Spring: 3 )
This course provides an introduction to algorithms, focusing on fundamental algorithmic ideas that are useful throughout the computational sciences. Topics include sequences, trees, and graphs; recursion; divide and conquer design; analysis of recurrence relations; asymptotic notation; probabilistic analysis; greedy algorithms; dynamic programming; pattern matching; and matrix computations. Applications to scientific computation will be discussed. An introduction to advanced topics such as parallel algorithms or machine learning may be included if time allows.
Instructor(s): Sergio Alvarez
Last Updated: 01-Apr-14