Department of Mathematics and Computer Science -- Courses

Complete Listing of All Math/CS Courses

Mathematics Courses

Continuation of MATH110. A thorough treatment of integral calculus, including the Fundamental Theorem of calculus. Transcendental functions, followed by a study of techniques of integration, polar coordinates, and an introduction to infinite series. Computer symbolic algebra projects are included. Prerequisite: MATH110. F, S.

MATH210 Multivariable Calculus (Nunemacher)

Vectors, partial derivatives, multiple integrals, and an introduction to vector analysis. Computer symbolic algebra projects are included. Mathematics majors are advised to take MATH250 concurrently. Prerequisite: MATH111. F.

MATH250 Discrete Mathematics (Radloff)

An introduction to mathematical reasoning and to the kind of mathematics appropriate for the study of properties of (possibly large) finite systems. Topics include proof techniques, mathematical induction, elementary number theory, combinatorics, relations, and graph theory. Applications will be made to the construction of models useful in the social and physical sciences and to the study of algorithms in computer science. Prerequisite: MATH111. F.

MATH260 Applied Statistics (Linder)

Calculus based introductory course in statistics. Exploratory data analysis, questions of causation, probability, continuous and discrete random variables, distributions of sums of random variables, confidence intervals, significance tests, use and abuse of tests, one and two sample procedures, inferences in linear regression, and analysis of variance. Students may not count graduation credit for both MATH260 and MATH105 or both MATH260 and PSYC210. Prerequisite: MATH110. S.

MATH270 Linear Algebra (Radloff)

Matrix algebra, finite dimensional vector spaces, linear transformations, determinants, eigenvalues, and applications. Prerequisite: MATH210 or permission of instructor. Recommended: MATH250. S.

MATH280 Differential Equations (Schwartz)

Study of first and second-order equations, numerical methods, and first-order systems. Applications to problems in physical, life, and social sciences are emphasized. Computer software is used to support the study by providing enhanced symbolic, numerical, and graphing capability. Additional topics include certain prerequisites from linear algebra (as needed), and Laplace transforms. Prerequisite: MATH111. S.

MATH310 Mathematical Logic (Nunemacher)

A study of the foundations of mathematics and logical reasoning. Topics include propositional calculus, predicate calculus, properties of formal systems, completeness and compactness theorems, Goedel's Incompleteness Theorem, and axiomatic set theory. Some attention will be given to related philosophical issues. Prerequisite: MATH250. Also listed as PHIL371.

MATH320 Geometry (Radloff)

Topics from Euclidean geometry, Non-Euclidean geometry, and projective geometry. Prerequisite: MATH250.

MATH330 Complex Variables (Nunemacher)

(Not offered 2000-2001)

A study of analytic functions, power series, complex integration, conformal mapping, and the calculus of residues with applications to physical science. Prerequisite: MATH210 and one mathematics course numbered 250 or above.

MATH335 Vector Analysis and Geometry (Nunemacher)

(Not offered 2000-2001)

Advanced calculus of functions of more than one variable. Topics include the geometry of Euclidean space, vector fields, line and surface integrals, curvature and differential geometry. Prerequisite: MATH210.

MATH340 Analysis I (Schwartz)

Rigorous development of the topology of the real line, theory of metric spaces, and the foundations of calculus. Attention is given to constructing formal proofs. Prerequisite: MATH210 and MATH250. Recommended: MATH270.

MATH345 Special Topics in Mathematics (Staff)

(Not offered 2000-2001)

A course of varying content reflecting the needs and interests of students.

MATH350 Probability (Schwartz)

(Not offered 2000-2001)

An introduction to the major topics of probability including sample spaces, conditional probability, discrete and continuous random variables, exception and variance, and limit theorems (Law of Large Numbers, Central Limit Theorem). Time permitting, topics in stochastic processes or statistics are introduced. Prerequisite: MATH210.

MATH360 Mathematical Statistics (Linder)

(Not offered 2000-2001)

Sampling distributions, derivation of distributions, proof of the Central Limit Theorem, methods of estimation, hypothesis testing, uniformly most powerful tests, estimation in multiple regression, nonparametric methods, experimental design. Prerequisite: MATH260, MATH270, and MATH350.

MATH365 Special Topics in Statistics (Linder)

A course of varying content reflecting the needs and interests of students.

MATH370 Abstract Algebra (Radloff)

(Not offered 2000-2001)

Introduction to the algebraic systems of groups, rings, and fields; with applications. Attention is given to the construction of formal proofs. Prerequisite: MATH250, MATH270.

MATH380 Applied Mathematics (Wiebe)

Selected topics in ordinary and partial differential equations including Sturm-Liouville problems, Fourier series, Laplace transforms, boundary value problems, and special functions of mathematical physics. Prerequisite: MATH210 and MATH280.

MATH385 Numerical Analysis (Nunemacher)

(Not offered 2000-2001)

A survey of numerical mathematics and continuous algorithms. Topics may include number representation, error analysis, finding roots of equations, interpolation, numerical differentiation and integration, solving systems of linear equations, and numerical methods for differential equations. FORTRAN will be introduced. Prerequisite: MATH210, MATH270, CS110.

MATH440 Analysis II (Schwartz)

(Not offered 2000-2001)

An advanced analysis course considering topics such as Lebesque measure and integration, Hilbert and Banach spaces, Fourier series, and topology. Prerequisite: MATH340.

MATH470 Abstract Algebra II (Radloff)

(Not offered 2000-2001)

Continuation of MATH270 and MATH370. Topics may include further group theory, field and Galois theory and linear algebra topics such as Jordan normal form. Prerequisite: MATH370.

MATH490 Independent Study in Mathematics (Staff)

Independent study of a topic in advanced mathematics under the guidance of a faculty member. Individually arranged.

MATH491 Directed Readings (Staff)

Reading in advanced mathematics under the guidance of a faculty member. Individually arranged.

MATH499 Seminar (Staff)

Intensive study of a topic selected by the faculty member in charge with presentations by students. Recent topics have included chaos, stochastic processes, combinatorics, experimental design, number theory, and curves and singularities.

Computer Science Courses

CS102 Problem Solving with Computers (Staff)

(Not offered 2000-2001)

An introduction to the uses of computers as problem-solving tools. Topics include: the synthesis, analysis, and visualization of information; the construction of models of real-world systems and organizational activities; the history of computing; the impact of computers on society. A variety of applications programs (spreadsheets, database management systems, etc.) will be introduced. This course is not intended for students with a major or minor in Computer Science or Mathematics. This course may not be taken for credit after receiving credit for any course numbered CS110 or above. F, S.

CS110 Introductory Computer Science and Programming (Staff)

An introduction to the fundamental concepts and abstractions of computer science, using a study of algorithms and computer programming as a vehicle. Topics include: the design, implementation, and application of algorithms; the uses of abstraction; the modeling and representation of values and entities; control flow and modularity. A high-level programming language is introduced and used. F, S.

CS250 Intermediate Computer Science and Data Structures (Zaring)

A continuation of the study of abstraction, algorithms, and computer programs. Concepts related to the design, analysis, and implementation of more advanced data types (lists, stacks, queues, trees, graphs, etc.) are covered in detail. Prerequisite: CS110. S.

CS255 Computer Organization (Zaring)

The organization and inner-workings of computers are covered in some detail, with an emphasis on the relationships among the various levels of hardware and software found in such systems. Attention is focused on both general concepts and on case studies of specific systems. Assembly language programming is introduced. Prerequisite: CS110 and CS250 or consent of instructor. F.

CS270 Paradigms of Computation (Zaring)

An introduction to the fundamental and emergent paradigms, both formal and pragmatic, of algorithms and computation. Topics include basic automata theory, functional programming, object-oriented design, and concurrent/parallel programming. The Scheme programming language is introduced. Prerequisite: CS250, CS255, MATH250. S.

CS310 Database Systems (Zaring)

(Not offered 2000-2001)

A study of the foundations, design, and implementation of database systems. Topics include data models, database design, query languages, database architectures, implementation issues, and case studies. Projects involving implementations of or use of database systems are required. Prerequisite: CS250, CS270 or consent of instructor, MATH250.

CS320 Computer Systems and Architecture (Zaring)

(Not offered 2000-2001)

A detailed discussion of computer architecture of computer systems, including studies of data- and control-paths, memory systems, and parallel/distributed systems. Programming and digital-circuit design projects may be required. Prerequisite: CS255, CS250, MATH250.

CS340 Artificial Intelligence (Zaring)

An introduction to issues surrounding machine intelligence. General topics include knowledge representation, searching, reasoning, learning, and planning. Specific problems drawn from areas including computer game playing, theorem proving, natural language processing, expert systems, and robotics will be addressed. Programming projects in LISP, Scheme, Prolog, or related languages are required. Prerequisite: CS250, CS270, MATH250.

CS350 Operating Systems (Wiebe)

The fundamental concepts of resource allocation in operating systems. This includes process management, storage management, device management, and networking issues. Case studies of actual operating systems will be presented. Prerequisite: CS255.

CS360 Algorithm Analysis and Design (Nunemacher)

(Not offered 2000-2001)

A continuation of the study of data structures begun in CS250 with emphasis on the design and analysis of algorithms. Also an introduction to questions of efficiency and NP completeness. Prerequisite: CS250, MATH111, MATH250.