Mathematics and Computer Science Curriculum

Computer Science

Major

Eleven courses in computer science including:
132, 232, 251, 314, 332, 356, 491, 492
A Systems course (352, 354 or another designated special topics course).
One elective numbered 200 or higher (Upon prior approval of the department, an appropriate course outside of computer science may replace the 200-level elective).
One elective course numbered 300 or higher.

Two courses in mathematics:
MATH 170
MATH 211

Minor

Six courses in computer science numbered 132 or higher, including:
132, 232 and 251
One elective course numbered 200 or higher (Upon prior approval of the department, an appropriate course outside of computer science may replace the 200-level elective.)
Two elective courses numbered 300 or higher.

Note: 131 is a prerequisite for 132. Students with prior programming experience may place out of 131.

Suggested Four Year Program

First Year: 131, 132, MATH 170 (or MATH 151 & 170)
Second Year: 251, 232, MATH 211
Third Year: 356, 354/352, 332, Computer Science Elective
Fourth Year: 491, 314, 492, Computer Science Elective

Note: Students who have taken Advanced Placement (AP) or International Baccalaureate (IB) exams may be given credit for COMP 131, COMP 132 and COMP 232 depending upon their score. Students without AP or IB scores but with least one year of object oriented programming experience in Java may, with faculty approval, be placed into COMP 132.

Honors in the Major

Departmental honors is the highest distinction that the Department can award to a Major. Majors who receive departmental honors will be those who demonstrate a broad mastery of the discipline as well as an ability to complete and present high quality research. A broad mastery of the discipline is demonstrated by a GPA of 3.40 or higher in all courses related to the major. The ability to complete high quality research is demonstrated by the completion of a yearlong research project. This project will be characterized by an independent and in-depth study of an advanced topic including a literature search, reading of original sources and a novel formulation of results. Finally, the ability to present such research is demonstrated by the preparation of an honors thesis, a public presentation and a successful defense of the work to the department faculty.

Courses

131 Introduction to Computer Science I
An introduction to Computer Science as a major scientific discipline. Special emphasis is placed on problem solving and experimentation via programming in Java. Topics covered include the design of objects and the use of flow-of-control constructs, along with techniques for testing software.
Three hours classroom and two hours laboratory a week. Offered every semester. This course fulfills either the DIV III lab science or QR distribution requirement.
132 Introduction to Computer Science II
A problem-solving course that utilizes object-based software design using Java. Topics include code modularity and reusability, recursion, data storage, and the empirical and theoretical comparison of elementary algorithms. The lab component focuses on programming as a tool for solving problems and simulating real-world events.
Prerequisite: 131 or one year of object oriented programming in Java and instructor's permission. Three hours classroom and two hours laboratory a week. Offered every semester. This course fulfills either the DIV III lab science or QR distribution requirement.
203, 204 Special Topics
Topics to be announced when offered.
Prerequisite: permission of the instructor. One-half or one course credit.
232 Data Structures and Problem Solving
An advanced problem-solving course that focuses on the design and analysis of data structures including lists, stacks, queues, trees, and hash tables. Concepts in generic programming are also introduced. The lab component focuses on the implementation of data structures and their application to solving complex problems.
Prerequisite: 132. Three hours of classroom and two hours laboratory a week. Offered every spring. This course fulfills either the DIV III lab science or QR distribution requirement.
241 Numerical Methods
An introduction to numerical methods for solving mathematical problems. Topics chosen from interpolation, numerical differentiation and integration, solutions to linear and non-linear systems, numerical solutions to differential equations and related topics.
Prerequisite: MATH 211 and knowledge of a programming language. This course is cross-listed as MATH 241. Offered in even numbered spring semesters. This course fulfills the QR distribution requirement.
251 Computer Organization and Architecture
An introduction to the internal structure and operation of computers. Topics include an introduction to assembly language programming, data representation, machine arithmetic, digital logic, basic hardware components, input/output processing and a survey of modern machine architectures.
Prerequisite: 132. Offered every fall. NOTE: Completion of both 251 and 332 fulfills the WR requirement.
314 Theoretical Foundations of Computer Science
An introduction to the theory of computation. Topics include formal language theory (grammars, languages, and automata including Turing machines), and an introduction to the concept of undecidable problems, including the halting problem.
Prerequisites: 132 and MATH 211. This course is cross-listed as MATH 314. Offered every spring.

331 Operations Research
An introduction to deterministic operations research, including linear programming, sensitivity analysis, and duality. Special topics may include transportation and assignment problems, network models, integer programming, and game theory.
Prerequisite: 262. This course is cross-listed as MATH 331. Offered in odd numbered fall semesters. This course fulfills the QR distribution requirement.

332 Analysis of Algorithms
A study of algorithmic approaches to problem-solving and techniques for analyzing and comparing algorithms. Approaches such as divide-and-conquer, dynamic programming, and backtracking will be explored in conjunction with complex structures such as trees and graphs. Topics in computational complexity include asymptotic complexity measures, intractability, and NP-complete problems.
Prerequisite: 232, MATH 211. Offered every fall. NOTE: Completion of both 251 and 332 fulfills the WR requirement.
352 Computer Networks
An examination of the hardware, software and protocols used in computer networks. Topics include layered architectures, client server computing, reliable and unreliable protocols, data encoding and compression, error detection and correction, routing, examination of the internet as an example and an introduction to network programming.
Prerequisite: 232 and 251. Offered in odd numbered springs.
354 Operating Systems
A study of the principles underlying the organization and implementation of computer operating systems. Topics include multiprogramming, time-sharing, mutual exclusion and synchronization, process scheduling, memory management, and file systems.
Prerequisites: 232 and 251. Offered in even numbered springs.
356 Programming Language Structures
An examination of the major programming language paradigms. The course also explores the basic properties and special facilities of languages representing each paradigm. Topics include data types, scope rules, block structures, procedure calls and parameter types, and storage allocation considerations.
Prerequisite: 232. Offered every fall.
364 Artificial Intelligence
A survey of techniques for applying computers to tasks usually considered to require human intelligence. Topics include knowledge representation and reasoning, search and constraint satisfaction, evolutionary and genetic algorithms, machine learning, neural networks, and philosophical questions.
Prerequisites: 232 and MATH 211. Offered in even numbered falls.
378 Database Systems
A study of the conceptual, technical and social issues involved in organizing, storing and accessing large volumes of data. Topics include data modeling, relational data base design, relational algebra, data definition languages and data manipulation languages.
Prerequisites: 232 and MATH 211. Offered in even numbered springs.
393, 394 Special Topics
Topics to be announced when offered. Possibilities include Software Engineering, Parallel Computing, and Compiler Design.
Prerequisite: permission of the instructor.
491 Fall Senior Seminar
Students define and begin a year-long project. Written and oral presentation of project progress reports will be required. Contemporary social, ethical, technical and philosophical issues in computer science will also be examined.
Prerequisite: Senior standing. Offered every fall.
492 Spring Senior Seminar
A continuation of the project begun in 491 culminating in a written thesis and public presentation. Additional contemporary issues in computer science may be considered.
Prerequisite: 491. Offered every spring.

Mathematics

Major

170, 171, 211, 262, 270, 351, 361
One math course having 351 or 361 as a prerequisite
One additional math course numbered 301 or higher
Two mathematics electives numbered 201 or higher. One elective may be replaced by COMP 131-132 or by the professional semester for students pursuing certification in mathematics, or, upon prior approval by the department, a mathematics-intensive course from another department.

Minor

171 and 211, one of the three courses 325, 351 or 361 and two other courses numbered 201 or higher. Possible tracks include: Track 1: 170, 171, 211, 262, 270, 361; Track 2: 170, 171, 211, 262, 351, elective; Track 3: 170, 171, 211, 225, 270, 325. Tracks 1 and 2 focus on theoretical mathematics. Track 3 focuses on statistics.

Suggested Four Year Program

Model 1 - MATH 151 as entry point (for students who place into 151)
First Year: 151, 170
Second Year: 171, 211, 270, 262
Third and Fourth Years: 351, 361, MATH Electives

Model 2 - MATH 170 as entry point (for students with suitable pre-calculus preparation)
First Year: 170, 171
Second Year: 211, 262, 270
Third and Fourth Years: 351, 361, MATH Electives

Model 3 - MATH 171 as entry point (for students with 170 credit)
First Year: 171, 270
Second Year: 211, 262
Third and fourth years: 351, 361, MATH electives

Model 4 - MATH 171 as entry point (for students with 170 and 270 credits)
First Year option 1: 171, MATH elective
First Year option 2: 211, 262
Second Year option 1: 211, 262
Second Year option 2: 171, MATH elective
Third and fourth years: 351, 361, MATH electives

Note: Students who have taken Advanced Placement (AP) or International Baccalaureate (IB) exams may begin the major with MATH 171 (Multivariable Calculus) or MATH 211 (Discrete Mathematics) depending upon their score.

Students who are interested in applied mathematics should consider the electives 225, 241, 325, and 331 during their third and fourth years.

Honors in the Major

Courses

121 Elementary Statistics
An introduction to the science of collecting, organizing, analyzing, and interpreting data. The focus is on data presentation and statistical reasoning based upon the analysis of data sets. Topics include the study of sampling methods, observational and experimental studies, graphical and numerical summaries of data, probability, sampling distributions, significance testing, estimation, and simple linear regression. Does not count toward the major or minor in mathematics.
Students cannot take this course concurrently with 225. Students who have received credit for 225 cannot take this course for credit. This course fulfills the QR distribution requirement. Offered every semester.
151 Introduction to Calculus
An introduction to limits and derivatives together with a review of polynomial, rational, trigonometric, exponential, and logarithmic functions.
Five hours of class time per week. Prerequisite: departmental placement. This course fulfills the QR distribution requirement. Offered every semester.
170 Single Variable Calculus
The study of real-valued functions, including transcendental functions, limits, derivatives, and their applications, the definition of the Riemann integral, and the Fundamental Theorem of Calculus.
Three hours of classroom and one and a half hours of lab per week. Prerequisite: 151 or departmental placement. This course fulfills the QR distribution requirement. Offered every semester.
171 Multivariable Calculus
Multivariable calculus including parametric and polar equations, vectors, three-dimensional analytic geometry, vector-valued functions, functions of several variables, partial derivatives, and multiple integrals. Additional topics if time permits.
Three hous classroom and one and a half hours of lab per week. Prerequisite: 170 or departmental placement. This course fulfills the QR distribution requirement. Offered every semester.
201, 202 Special Topics
Topics to be announced when offered.
Prerequisite: permission of the instructor. One-half or one course.
211 Discrete Mathematics
An introduction to fundamental mathematical concepts used in mathematics as well as computer science, with an emphasis on writing mathematical arguments. The course presents the principles of mathematical logic and methods of proof such as direct and indirect proofs and mathematical induction. Other topics include sets, functions, relations, matrix algebra, and techniques from elementary combinatorics and graph theory.
Prerequisite: 170 or COMP 131 or departmental placement. This course fulfills the WR requirement. This course fulfills the QR distribution requirement.Offered every fall.
225 Probability and Statistics I
An introduction to the core topics of probability and statistics. Topics include discrete and continuous random variables, joint distributions, expectation, variance, random sampling from populations, hypothesis tests, and confidence intervals.
Prerequisite: 171. Offered in even numbered fall semesters. This course fulfills the QR distribution requirement.
241 Numerical Methods
An introduction to numerical methods for solving mathematical problems. Topics chosen from interpolation, numerical differentiation and integration, solutions to linear and non-linear systems, numerical solutions to differential equations and related topics.
Prerequisite: 171 or 211 or 270 and knowledge of a programming language. This course is cross-listed as COMP 241. This course fulfills the QR distribution requirement. Offered in odd numbered fall semesters.
262 Introduction to Linear Algebra
An introduction to matrix algebra and abstract vector spaces with an emphasis on writing mathematical arguments. Topics include linear systems and matrices, vector spaces, linear independence, eigenvalues and eigenvectors.
Prerequisite: 211 or permission of the instructor. This course fulfills the QR distribution requirement. Offered every spring.
270 Integration and Infinite Series
The study of methods of integration, applications of the integral, elementary differential equations, and infinite sequences and series.
Prerequisite: 171or departmental placement. This course fulfills the QR distribution requirement. Offered every spring.
271 Differential Equations
Elementary methods of solutions of selected types of differential equations; solutions of systems of linear differential equations with constant coefficients; and a brief introduction to numerical methods and series solutions. Includes a strong emphasis on applications.
Prerequisite: 171 and 270. This course fulfills the QR distribution requirement. Offered in even numbered spring semesters.
301, 302 Special Topics
Topics to be announced when offered.
Prerequisite dependent upon topic. One-half or one course credit. This course fulfills the QR distribution requirement.
311 Applied Combinatorics
An advanced course in discrete mathematics introducing the basic tools of combinatorics and their applications. The course will consider the three basic problems of combinatorics; counting, existence and optimization.
Prerequisite: 211. This course fulfills the QR distribution requirement. Offered even numbered spring semesters.
314 Theoretical Foundations of Computer Science
An introduction to the theory of computation. Topics include formal language theory (grammars, languages, and automata including Turing machines), and an introduction to the concept of undecidable problems, including the halting problem.
Prerequisite: COMP 132 and MATH 211. This course is cross-listed as COMP 314.
325 Probability and Statistics II
A continuation of Introduction to Probability and Statistics I. Topics include additional discrete and continuous distributions, conditional distributions, additional hypothesis tests, simple linear regression and correlation, multiple linear regression, analysis of variance, and goodness of fit tests. Special topics may include nonparametric tests, nonlinear regression, and time series analysis.
Prerequisites: 171, 225 and 270. This course fulfills the QR distribution requirement. Offered in odd numbered spring semesters.
331 Operations Research
An introduction to deterministic operations research, including linear programming, sensitivity analysis, and duality. Special topics may include transportation and assignment problems, network models, integer programming, and game theory.
Prerequisite: 262. This course is cross-listed as COMP 331. This course fulfills the QR distribution requirement. Offered in odd numbered fall semesters.
351 Abstract Algebra
An introduction to axiomatic formalism using algebraic structures as paradigms. Topics chosen from groups, rings, integral domains, fields and vector spaces.
Prerequisite: 262. This course fulfills the QR distribution requirement. Offered every spring.
361 Real Analysis
A theoretical development of the basic ideas and concepts of real analysis. Topics include a study of real numbers, sequences, limits and continuity, differentiation and integration. Optional topics include infinite series, sequences and series of functions, and an introduction to point-set topology.
Prerequisite: 171, 262 and 270. This course fulfills the QR distribution requirement. Offered every fall.
401, 402 Special Topics
Topics to be announced when offered.
Prerequisite dependent upon topic. One-half or one course credit.
472 Complex Analysis
An introductory study of functions in the complex plane. Topics include: complex numbers and functions, the theory of differentiation and integration of complex functions; Cauchy's integral theorem; the Residue theorem.
Prerequisite: 361 and completion of, or concurrent registration in 351. This course fulfills the QR distribution requirement. Offered in odd numbered spring semesters.
481 Topology
An elementary study of topological spaces. Topics include open and closed sets, the Hausdorff property, compactness, connectedness, continuity, homeomorphisms, product spaces, and the classification of spaces. Optional topics include metric spaces, identification spaces, manifolds, and the fundamental group.
Prerequisite: 361 and completion of, or concurrent registration in 351. This course fulfills the QR distribution requirement. Offered in even numbered spring semesters.