http://www.reed.edu/math/requirements.html
Requirements for the Mathematics Major with Concentration in Computer Science
Mathematics 111 or the equivalent, 112, 211, and 212
Mathematics 121 or the equivalent, and 221
Mathematics 331, 382, 387, and 389
Mathematics 470
Three additional units in mathematics courses numbered higher than 300
Mathematics 111 - Calculus
Full course for one semester. This includes a treatment of limits, continuity, derivatives, mean value theorem, integration—including the fundamental theorem of calculus, and definitions of the trigonometric, logarithmic, and exponential functions. Prerequisite: three years of high school mathematics. Lecture-conference.
Mathematics 112 - Introduction to Analysis
Full course for one semester. Field axioms, the real and complex fields, sequences and series. Complex functions, continuity and differentiation; power series and the complex exponential. Prerequisite: Mathematics 111 or equivalent. Lecture-conference.
Mathematics 211 - Multivariable Calculus I
Full course for one semester. A development of the basic theorems of multivariable differential calculus, optimization, and Taylor series. Inverse and implicit function theorems may be included. Prerequisite: Mathematics 112 or consent of the instructor. Lecture-conference.
Mathematics 212 - Multivariable Calculus II
Full course for one semester. A study of line, multiple, and surface integrals, including Green’s and Stokes’s theorems and linear differential equations. Differential geometry of curves and surfaces or Fourier series may be included. Prerequisite: Mathematics 112 and 211 or consent of the instructor. Lecture-conference.
Mathematics 121 - Introduction to Computing
Full course for one semester. An introduction to computer science, covering topics such as elementary data structures, algorithms, computability, floating point computations, and programming in a high-level language. Prerequisite: three years of high school mathematics. Lecture-conference and lab.
Mathematics 221 - Computer Science Fundamentals II
Full course for one semester. A second course in computer science, an introduction to advanced structures and techniques. The course will develop the foundations of computing, providing an introduction to theoretical models of computation and also to practical computer system construction. Selected topics include: digital design, from gates to processors; the construction of interpreters, including language parsing and run-time systems; parallelism and concurrency; and universality. There will be significant programming projects exploring a number of these topics, and students will be introduced to the advanced programming techniques and data structures that support their construction. Prerequisite: Mathematics 121. Lecture-conference.
Mathematics 331 - Linear Algebra
Full course for one semester. A brief introduction to field structures, followed by presentation of the algebraic theory of finite dimensional vector spaces. Geometry of inner product spaces is examined in the setting of real and complex fields. Prerequisite: Mathematics 112 and 211, or consent of the instructor. Lecture-conference.
Mathematics 382 - Algorithms and Data Structures
Full course for one semester. An introduction to computer science covering the design and analysis of algorithms. The course will focus on various abstract data types and associated algorithms. The course will include implementation of some of these ideas on a computer. Prerequisites: Mathematics 121 and 211 or consent of the instructor. Lecture-conference.
Mathematics 387 - Computability and Complexity
Full course for one semester. Introduction to models of computation including finite automata, formal languages, and Turing machines, culminating in universality and undecidability. An introduction to resource-bounded models of computation and algorithmic complexity classes, including NP and PSPACE, and the notions of relative hardness and completeness. Prerequisite: Mathematics 121 and three semesters of college mathematics. Lecture-conference.
Mathematics 389 - Computer Systems
Full course for one semester. A study of the design and implementation of computing systems, focusing on aspects whose underpinnings are firmly based in algorithms and applied logic or whose implementation offers interesting problems in those areas. A survey of computer architecture and the hardware-software interface, compilation and run time, and concurrent and networked programming. An introduction to theoretical approaches to problems related to the synchronization and coordination of independently executing processes. Prerequisite: Mathematics 121 and additional programming experience equivalent to Mathematics 382, 384, or 385. Lecture-conference.
Presuming someone who does this major takes these electives:
Mathematics 384 - Programming Language Design and Implementation
Full course for one semester. A study of the organization and structure of modern programming languages. This course will survey key programming language paradigms, including functional, object-oriented, and logic- and constraint-based languages. A formal approach will be taken to understanding the fundamental concepts underlying these paradigms, including their syntax, semantics, and type systems. The course will cover selected topics in the implementation of language systems such as parsers, interpreters, and compilers, and of run-time support for high-level languages. Prerequisite: Mathematics 121. Lecture-conference.
Mathematics 385 - Computer Graphics
Full course for one semester. Introduction to computer image synthesis and mathematical modeling for computer graphics applications. Topics include image processing, 2-D and 3-D modeling techniques such as curve and surface representation, geometric algorithms for intersection and hidden surface removal, 3-D rendering, and animation. Prerequisite: Mathematics 121 and 211. Mathematics 331 recommended. Lecture-conference. Offered in alternate years. Not offered 2015-16.
Something from here:
Mathematics 441 - Topics in Computer Science Theory
Full course for one semester. Exploration of topics from advanced algorithm design and theoretical computer science including complexity theory, cryptography, computational geometry, and randomized algorithms, as selected by the instructor. Prerequisite: Mathematics 382 or consent of the instructor. Lecture-conference. Offered in alternate years. Not offered 2015-16.
Mathematics 442 - Topics in Computer Science Systems
Full course for one semester. A study of the design and implementation techniques used in a particular area of computer science as selected by the instructor. Students will implement a working system in that area. Recent offerings have covered distributed and networked systems, compilers, and computer game design. Prerequisite: Mathematics 382 or consent of the instructor. Lecture-conference. Offered in alternate years.
My question, then, is how does this program compare to those of different schools, and is it sufficient preparation for work in industry/grad school? A lot of Reed students already go and work in technology, with degrees in physics, math, etc, which seems to prepare them for the field b/c of the quantitative background. Does this program do more?