CS 231. Computer Organization. The entire hierarchical structure of computer architecture, beginning at the lowest level with a simple machine model (e.g., a simple von Neumann machine). Processors, process handling, I/O handling, and assembler concepts.
CS 258. Introduction to Computer Graphics. Featuring 2D rendering and image-based techniques, 2D and 3D transformations, modeling, 3D rendering, graphics pipeline, ray-tracing, and texture-mapping.
MATH 200. Intensive Problem Solving and Exposition. Intended to develop widely applicable mathematical skills. Focus on use of basic principles such as induction, the pigeonhole principle, symmetry, parity, and generating functions.
MATH 221. Theory of Numbers. The Euclidean algorithm, Euler’s phi function, simple continued fractions, congruences, Fermat’s theorem, Wilson’s theorem, and elementary Diophantine equations.
MATH 226/CS 255. Introduction to Numerical Mathematics. Numerical solution of linear and nonlinear equations, interpolation and polynomial approximation, non-numerical differentiation and integration, least-squares curve fitting and approximation theory, numerical solution of differential equations, errors and floating point arithmetic. Application of the theory to problems in science, engineering, and economics. Student use of the computer is emphasized.
How does this all sound?