This is a survey course which explores a broad spectrum of mathematical topics. The emphasis is on observing the many practical uses of mathematics in our modern society and not on developing skill in manipulative techniques. This course does not satisfy the prerequisites for further mathematics courses, nor does it count toward a major or minor. No prerequisite. Fall and Spring. [Q, +]
Basic elements of descriptive and inferential statistics. Not to count toward a major or minor. Prerequisite: one year of algebra. Annually. Spring. [Q, +]
A course designed primarily for students in the social sciences.Topics include probability, math of finance, matrix algebra, and linear programming. Prerequisite: Solid background in algebra. This course does not count toward a major or minor. Not offered 2008-2009. [Q, +]
A course designed primarily for students in the social sciences. Topics include functions, limits, differentiation, integration, and applications of these. Prerequisite: Math 101 or Math 103 or placement into Math 104. This course does not count toward a major or a minor. Credit cannot be given for both Math 104 and 108 or 111. Annually. Spring. [Q, +]
The first in a two-course sequence that integrates precalculus and first-semester calculus topics. This course and Math 108 will examine the algebraic, geometric, and analytic properties of polynomial, trigonometric, exponential and logarithmic functions. Limits, continuity, differentiation, and integration in connection with these functions will be studied, along with applications. This course does not count toward a major or minor and may not be taken by anyone with credit for Math 101, Math 104 or Math 111. Annually. Fall and Spring 2008-2009. [Q, +]
This is a continuation of Math 107 and will cover topics in differential and integral calculus. Additional background algebraic material will be provided as needed. This course counts toward a major or minor and may not be taken by anyone with credit for Math 104 or Math 111, nor can a student receive credit for both this course and Math 104 or Math 111. Annually. Spring. [Q, +]
This course and 112 cover the calculus of functions of one variable. Limits, continuity, differentiation and integration, applications of the calculus, elements of analytic geometry, the Fundamental Theorem of Calculus, and Taylor's Theorem. Prerequisite: Math 101 or placement into Math 111. Annually. Fall. [Q, +]
Continuation of 111, including calculus of transcendental functions, integration techniques, and infinite series. Prerequisite: Math 111 or Math 108. Annually. Fall and Spring. [Q, +]
This course includes logic, proofs, sets, relations, functions, algorithms, counting methods, recurrence relations, graph theory, trees, Boolean Algebras, automata and grammars. Prerequisite: Some computer programming experience and either Math 101, Math 107, or placement into Math 111. Alternate years. Not offered 2008-2009.
Systems of linear equations, matrix theory, vector spaces and linear transformations, determinants, eigenvalues and eigenvectors, inner product spaces. Prerequisite: Math 112 or permission of the instructor. Annually. Fall. [W, Q, +]
Analytic geometry of functions of several variables, limits and partial derivatives, multiple and iterated integrals, non-rectangular coordinates, change of variables, line and surface integrals and the theorems of Green and Stokes. Prerequisite: Math 112. Annually. Spring. [Q, +]
The content and prerequisites of this course will vary according to the needs of students. It will be given at irregular intervals when there is need for some special topic. Variable course credit.
Forms of solution (algebraic, numeric, qualitative, geometric), first order equations (their solution and application), higher order linear equations (applications, solutions for constant coefficients, initial value problems, Laplace transforms), series and series solutions of linear equations, introduction to partial differential equations and Fourier series. Prerequisite: Math 112. Alternate years. Fall 2008-2009.
This course introduces the basic techniques and modes of reasoning of combinatorial problem-solving in the same spirit that calculus introduces continuous problem-solving. It will include topics in graph theory, combinatorics, inclusion/exclusion principle, recurrence relations, and generating functions. Prerequisite: Math 123 or 211. Alternate years. Not offered 2008-2009.
This course considers a wide variety of mathematical models in the physical, life, and social sciences. Not only are models analyzed but a major component of the course is practice in constructing mathematical models and testing their validity with empirical data. Prerequisite: Math 211. Alternate years. Not offered 2008-2009.
This course begins with an introduction to the general methodology of operations research supported by examples and a brief history. A fairly extensive coverage of the theory and applications of linear programming leads to both discrete and continuous models used in economics and the management sciences. Among those models are nonlinear programming, continuous and discrete probability models, dynamic programming, and transportation and network flow models. Prerequisite: Math 211 and Math 212 concurrently. Alternate years. Spring 2008-2009.
Topics to be chosen from among interpolation theory, solution of nonlinear equations and systems of linear and nonlinear equations, numerical differentiation and integration, solution of ordinary differential equations, difference equations, and error analysis. Prerequisite: CS 151, Math 112, and Math 201 at least concurrently. Alternate years. Spring 2008-2009.
An introduction to probability and statistics. Permutations and combinations, sample spaces probability, random variables, discrete probability distributions, continuous probability distributions, multivariate distributions, transformations of random variables, moment generating function techniques. Prerequisite: Math 112. Alternate years. Not offered 2008-2009.
A continuation of Math 241. Random vectors and random sampling, estimation and hypothesis testing, analysis of variance, regression, and nonparametric statistics. Prerequisite: Math 211 and 241. Alternate years. Not offered 2008-2009.
This course is a transition course from the primarily computational alnd algorithmic mathematics found in calculus to the more theoretical and abstract mathematics in junior/senior level courses. The emphasis is on developing the skills and tools needed to read and write proofs, and to understand their importance in mathematics. The course examines topics such as set theory and logic, mathematical induction, and a number of other proof techniques. Prerequisite: Math 211 or concurrently. Annually. Fall.
A seminar in problem-solving. In the Fall, analysis and solution of advanced contest-type problems, concluding with the taking of the Putnam Examination. In the Spring, the seminar may include the Modeling Competition in addition to introduction to problem solving. S/NC course. One-fourth course credit. (May be repeated for credit.) Annually. Fall and Spring.
Sets and functions, metric spaces, topological spaces, compactness,
separation, connectedness.
Prerequisite: 211 and 212 or permission of instructor. Spring 2008-2009.
Sets, real numbers, Cartesian spaces, convergence, continuous functions, elements of differentiation and integration theory. Prerequisite: 211 and 212 or permission of instructor. Alternate years. Fall 2008-2009.
A continuation of 302. Further topics in differentiation and integration, series of functions, introduction to the Lebesque integral. Prerequisite: 302. Spring 2008-2009.
This course and 305 include an axiomatic approach to algebraic structures, elementary properties of numbers, polynomials, groups, rings, integral domains, and fields. Prerequisite: 211. Annually. Fall.
A continuation of 304, which is a prerequisite. Offered as needed.
Complex numbers, elementary functions, Cauchy's theorem and formula, infinite series, elements of conformal mapping, residues. Prerequisite: 212 and permission of instructor. Not offered 2008-2009.
The content and prerequisites of this course will vary according to the needs of students. It will be given at irregular intervals when there is need for some special topic. Variable course credit
This course will be given for topics not normally covered in regular courses. Approval of both chairperson and supervising faculty member required prior to registration.
History of computing, computer applications, user interface design, computer programming, program assembly, computer hardware, theory of computation, artificial intelligence, computers and society. Two hours lecture and two hours laboratory each week. No prerequisite in mathematics or science. Annually. Fall. [+]
Elements of programming languages, programming, computer organization, and algorithm development. Prerequisite: Thorough grounding in algebra. One and one-fourth credits. Annually. Fall and Spring. [+]
A continuation of CS 151. Structured programming concepts, dynamic data structures, string processing, recursion, searching and sorting. Prerequisite: CS 151. One and one-fourth credits. Annually. Fall and Spring. [+]
Computer structure and machine language. Addressing techniques. Basic logic design, coding, number representation and arithmetic. Pipelining and parallelism. Telecommunications, networks, and distributed systems. Prerequisite: CS 152. Annually. Fall.
A systematic study of algorithms and their complexity. The limitations of algorithms are also studied in the context of NP-completeness. Prerequisite: CS 152 and Mathematics 123, 211 or 223. Spring 2008-2009.
The theory of automata and formal languages. Computability by Turing machines and recursive functions; uncomputability, computational complexity, and mathematical logic. Prerequisite: CS 152 and Mathematics 123 or 223. Annually. Spring.
This course provides the opportunity for students to practice working through computer science problems. Typically, this will be for those students intending to prepare for a programming contest in which the College will participate. Such a contest would be the culmination of this course. S/NC course. One-fourth credit. (May be repeated for credit.) Prerequisite: CS 151. Fall or Spring, as contest scheduling demands. Fall 2008-2009.
The content and prerequisites of this course vary according to the topic chosen. The course is available at irregular intervals when there is a need for a special topic. Prerequisite: Permission of the instructor. Variable course credit.
Language definition, data types and structures, control structures; run-time environment, interpreters, lexical analysis and parsing, Backus normal form language descriptors and basic parsing concepts, Symbol table manipulation, code generation, local optimization, and storage allocation. Prerequisite: CS 251; CS 252 is recommended. Annually. Spring 2008-2009.
Review of instruction sets, I/O and interrupt structure, addressing schemes and microprogramming. Dynamic procedure activation. Elementary queueing. Memory management, process management and recovery procedures. Prerequisite: CS 251; Mathematics 241 is recommended. Alternate years. Spring. Not offered 2008-2009.
Sequential, hash, and indexed sequential files. Data description languages, query facilities, plus file and index organization. Prerequisite: CS 252. Alternate years. Fall 2008-2009.
This course explores the theory and application of computer graphics through the evolution of graphics algorithms and hardware. Topics include 2-D, 3-D transformations and projections, illumination models, texture mapping, animation, user interfaces, and rendering algorithms. Prerequisites: CS 152 and Math 211. Alternate years. Not offered 2008-2009.
A study of multiple paradigms in machine and artificial intelligence. Topics include concept learning, hypothesis sets, hypothesis evaluation, computational learning theory, decision trees, artificial neural nets, Bayesian learning, rule-based learning, genetic algorithms. Prerequisites: CS 152 and Math 211. Alternate years. Spring 2008-2009.
This course will be given for topics not normally covered in regular courses. Prerequisite: CS 252. Approval of both chairperson and supervising faculty member required prior to registration.
Prerequisite: CS 252