| WHEN TAUGHT: | Fall; Winter; Spring; Summer |
| PREREQUISITE: | C S 142 or concurrent enrollment. |
| DESCRIPTION:  | How a computer works, from hardware to high-level programming. Logic circuits, computer instructions, assembly language, binary arithmetic, C programming, program translation, data structures, and algorithm analysis. |
| WHEN TAUGHT: | Fall; Winter; Spring |
| PREREQUISITE: | Knowledge of algebra. |
| DESCRIPTION:  | Introduction to object-oriented program design and development. Principles of algorithm formulation and implementation. |
| WHEN TAUGHT: | Fall; Winter; Spring; Summer |
| PREREQUISITE: | C S 142 |
| DESCRIPTION:  | Fundamental data structures and algorithms of computer science; basic algorithm analysis; recursion; sorting and searching; lists, stacks, queues, trees, hashing; object-oriented data abstraction. |
| WHEN TAUGHT: | Fall; Winter; Summer |
| PREREQUISITE: | C S 235 |
| DESCRIPTION:  | Introduction to grammars and parsing; predicate and propositional logic; proof techniques; sets, functions, relations, relational data model; graphs and graph algorithms. |
| WHEN TAUGHT: | Fall; Winter; Spring; Summer |
| PREREQUISITE: | C S 236 |
| DESCRIPTION:  | Advanced software development with an object-oriented focus. Development and testing of several 1500 to 2000 line modules from formal specifications. UNIX and C++ environment. |
| WHEN TAUGHT: | Fall; Winter |
| PREREQUISITE: | C S 236 or concurrent enrollment. |
| DESCRIPTION:  | Finite state automata, regular languages, lexical analysis; push-down automata, context-free languages, parsing; Turing machines and unrestricted grammars; computability complexity, NP-completeness. |
| WHEN TAUGHT: | Fall; Winter; Spring |
| PREREQUISITE: | C S 240 & C S 252 |
| DESCRIPTION:  | Analysis of algorithms including searching, sorting, graphs, and trees. |
| WHEN TAUGHT: | Fall; Winter |
| PREREQUISITE: | C S 240 |
| DESCRIPTION:  | Principles and concepts characterizing high-level computer programming languages, process and data abstration, encapsulation, inheritance, functional programming, logic programming, scanners, and parsers. |
| WHEN TAUGHT: | Fall; Winter; Spring; Summer |
| PREREQUISITE: | C S 240 |
| DESCRIPTION:  | Principles of software design, design patterns, design representation, refactoring. Principles of software quality assurance and testing. Development and testing tools. |
| WHEN TAUGHT: | Fall; Winter; Summer |
| PREREQUISITE: | C S 124 & C S 240 |
| DESCRIPTION:  | Principles and concepts of operating systems design and the implementation of an operating system. |
| WHEN TAUGHT: | Fall; Winter |
| PREREQUISITE: | C S 240 |
| DESCRIPTION:  | Internet application programming, including sockets, threads, CGI, database, e-commerce, Web services. |
| WHEN TAUGHT: | Fall; Winter |
| PREREQUISITE: | C S 240 & ENGL 316; Junior-senior status. |
| DESCRIPTION:  | Societal impact of computer technology, the computer scientist's place in society, ethical issues. Reading, discussion, and writing seminar. |
| OFFERED: | Honors also. |
| WHEN TAUGHT: | Fall; Winter; Spring; Summer |
| PREREQUISITE: | Junior or senior status. |
| DESCRIPTION:  | Effective processes of written, oral, and visual technical communication, including collaborative processes. Writing for academic and professional audiences. |
| NOTE: | Carries GE Advanced Written and Oral Communication credit. |
| OFFERED: | Honors also. |
| WHEN TAUGHT: | Fall; Winter; Spring; Summer |
| PREREQUISITE: | Math 110 and 111 or equivalent. |
| DESCRIPTION:  | Differential and integral calculus: limits; continuity; the derivative and applications; extrema; the definite integral; fundamental theorem of calculus; L'Hopital's rule. |
| OFFERED: | Honors also. |
| WHEN TAUGHT: | Fall; Winter; Spring; Summer |
| PREREQUISITE: | Math 112 or equivalent. |
| DESCRIPTION:  | Techniques and applications of integration; sequences, series, convergence tests, power series; parametric equations; polar coordinates. |
| OFFERED: | Honors also. |
| WHEN TAUGHT: | Fall; Winter; Spring; Summer |
| PREREQUISITE: | MATH 112; or MATH 119 |
| DESCRIPTION:  | Linear systems, matrices, vectors and vector spaces, linear transformations, determinants, inner product spaces, eigenvalues, and eigenvectors. |
| WHEN TAUGHT: | Fall; Winter; Spring |
| PREREQUISITE: | Calculus or concurrent enrollment. |
| DESCRIPTION:  | Newtonian mechanics. Weekly lab. |
| OFFERED: | Independent Study also; Honors also. |
| WHEN TAUGHT: | Fall; Winter; Spring; Summer |
| RECOMMENDED: | MATH 110 or equivalent. |
| DESCRIPTION:  | Stemplots, boxplots, histograms, scatterplots; central tendency, variability; confidence intervals and hypothesis testing involving one and two means and proportions; contingency tables, simple linear regression. |
| WHEN TAUGHT: | Fall; Winter; Spring |
| PREREQUISITE: | MATH 112; or MATH 119 |
| DESCRIPTION:  | The scientific method; probability, random variables, common discrete and continuous random variables, central limit theorem; confidence intervals and hypothesis testing; completely randomized experiments; factorial experiments. |
| WHEN TAUGHT: | Fall; Winter; Spring |
| PREREQUISITE: | EC EN 224 & C S 235 |
| DESCRIPTION:  | Machine-level representations of programs and data, processor architecture, program performance optimizaton, memory hierarchies, virtual memory, linking, exceptions. |
| WHEN TAUGHT: | Fall |
| PREREQUISITE: | EC EN 324 |
| DESCRIPTION:  | Hardware/software interface, real-time kernel internals, implementation of high-level language constructs, issues in real-time application software development. |
| WHEN TAUGHT: | Winter |
| PREREQUISITE: | Chem 111 or equivalent. |
| DESCRIPTION:  | Continuation of Chem 111. |
| NOTE: | Tutorial included. |
| WHEN TAUGHT: | Fall; Winter |
| PREREQUISITE: | C S 240 & ENGL 316 |
| DESCRIPTION:  | Entrepreneurship, idea/opportunity generation, strategic planning, legal organization, product development, marketing/sales, customer support, fund raising, and effective management. |
| WHEN TAUGHT: | Fall; Winter |
| PREREQUISITE: | CS-ECEn 124. |
| DESCRIPTION:  | Digital logic: theory, design, and implementation of combinational and sequential logic. Laboratory experience in construction of digital logic circuits. |
| WHEN TAUGHT: | Winter |
| PREREQUISITE: | GEOL 111 |
| DESCRIPTION:  | Developmental history of the earth, its landforms, and life forms, emphasizing the North American continent. Field trips and lab studies. |
| WHEN TAUGHT: | Fall; Winter; Spring; Summer |
| PREREQUISITE: | MATH 313 |
| DESCRIPTION:  | Partial differentiation, the Jacobian matrix, and integral theorems of vector calculus. |
| WHEN TAUGHT: | Fall; Winter; Spring; Summer |
| PREREQUISITE: | MATH 113 & MATH 313 |
| DESCRIPTION:  | Methods and theory of ordinary differential equations. |
| WHEN TAUGHT: | Fall; Winter |
| PREREQUISITE: | MATH 113 & MATH 290 |
| DESCRIPTION:  | Rigorous treatment of calculus of a single real variable: topology, order, completeness of real numbers; continuity, differentiability, integrability, and convergence of functions. |
| WHEN TAUGHT: | Winter |
| PREREQUISITE: | MATH 313 |
| DESCRIPTION:  | Maps, graphs and digraphs, coloring problems, applications. |
| WHEN TAUGHT: | Fall; Winter; Spring |
| PREREQUISITE: | MATH 290 & MATH 313 |
| DESCRIPTION:  | Groups, group homomorphisms, rings, ideals, and polynomials. |
| WHEN TAUGHT: | Fall |
| PREREQUISITE: | MATH 314 |
| DESCRIPTION:  | Root finding, interpolation, curve fitting, numerical differentiation and integration, multiple integrals, direct solvers for linear systems, least squares, rational approximations, Fourier and other orthogonal methods. |
| WHEN TAUGHT: | Fall |
| PREREQUISITE: | MATH 112 |
| DESCRIPTION:  | Using tools in mathematics to help biologists. Motivating new mathematics with questions in biology. |
| WHEN TAUGHT: | Winter |
| PREREQUISITE: | MATH 371 |
| DESCRIPTION:  | Permutations, combinations, recurrence relations, applications. |
| WHEN TAUGHT: | Winter |
| PREREQUISITE: | MATH 313 |
| RECOMMENDED: | Math 371. |
| DESCRIPTION:  | A mathematical introduction to some of the high points of modern cryptography. |
| OFFERED: | Honors also |
| WHEN TAUGHT: | Fall; Winter; Summer |
| DESCRIPTION:  | General biology course designed for biological science majors, emphasizing the scientific method, cell theory, biochemical unity, the central dogma, bioenergetics, reproduction, and evolutionary theory. |
| WHEN TAUGHT: | Fall; Winter On Demand; Spring |
| PREREQUISITE: | MATH 112 |
| DESCRIPTION:  | The scientific method; conditional probability; Bayes' Theorem; conjugate distributions: Beta-binomial, Poisson-gamma, normal-normal; Gibbs sampling. |
| WHEN TAUGHT: | Fall; Winter; Spring |
| PREREQUISITE: | Stat 121, 151, 201, or 301. |
| DESCRIPTION:  | Scientific method, statistical thinking, sources of variation, completely randomized design, ANOVA, power and sample size consideration, multiple testing, randomized complete blocks, factorial designs, interactions. Introduction to statistical software. |
| WHEN TAUGHT: | Fall; Winter; Summer |
| PREREQUISITE: | Stat 121 or 151 or 201 or 301. |
| RECOMMENDED: | Math 112 or concurrent enrollment. |
| DESCRIPTION:  | Set theory; discrete probability; conditional probability; finite sample spaces; discrete random variables (pdf, cdf, moments). |
*Hours include courses that may fulfill university core requirements.