The design, analysis, and implementation of numerical algorithms for solving problems in science and engineering. Emphasis on program design, including data structures, computational complexity, scientific computing environments, and high-performance software packages. 3 hour lab required. Finite automata and regular sets. Introduction to Turing machines and undecidability.
Students begin writing a senior thesis.
Writing emphasis course. Emphasis on faculty research. May be repeated. Maximum 9 hours. Completion of core curriculum or consent of instructor.