Mathematics and Computer Science Courses

Mathematics Courses

100. Topics in Mathematics

The beauty and the power of mathematics are explored through an intensive study of an important area of mathematics. (Credit, full course.) Staff

101. Calculus I

An elementary course introducing the student to the basic concepts of calculus: functions, transcendental functions, limits, derivatives, and integrals. Emphasis on problem solving. (Credit, full course.) Staff

102. Calculus II

A continuation of Calculus I. Topics include further theory and applications of integration, techniques of integration, and introduction to series. Some work with a computer is included. (Credit, full course.) Staff

103. Calculus II and Computer Modeling

This course is designed to cover the integration and series material of the standard Calculus II course. In addition, the course has a three-hour computer laboratory component so that the material is applied to open-ended projects on which teams of students work. A general theme of these labs is modeling real-world systems (recycling, pricing, probabilities in biological settings, etc.) with differential equations, integrals, or series so that students can begin to see more in-depth applications of mathematics. Prerequisite: Math 101 or equivalent. (Credit, full course.) Puckette

104. Chance

Chance focuses on probability theory and its relationship to the science of statistics. Topics are selected from sets and counting, basic probability, random variables, Markov systems, descriptive statistics, confidence intervals and hypothesis testing. Students read, report on and discuss articles selected from newspapers, scientific and mathematics journals. Students are expected to have a background in calculus. (Credit, full course.) Cavagnaro

107. Secure Messages: Secure and Insecure Encryption

This course is an introduction to cryptology. The mathematics and history of encryption and decryption are studied, beginning with the Caesar Cipher and ending with present-day public key encryption techniques. Students learn the elementary number theory on which present encryption methods are based. The role of encryption in the past and in modern society are considered. (Credit, full course.) Staff

207. Multidimensional Calculus

Calculus of several variables. Vectors, partial and directional derivatives, space curves, gradients, maxima and minima, linear and differentiable transformations, vector fields, line integrals, multidimensional Riemann integrals, and applications in physics and geometry are considered. Prerequisite: Math 102. (Credit, full course.) Staff

210. Linear Algebra

A course designed to provide some important mathematical tools useful in a variety of fields. Systems of linear equations, vectors and matrices, determinants, vector spaces, linear transformations, inner and cross products, and eigenvalues and canonical forms are considered. Prerequisite or corequisite: Math 102. (Credit, full course.) Staff

212. Differential Equations

Ordinary differential equations, with applications. Methods of numerical approximation, power series, and Laplace transforms. Existence and uniqueness of solution. Prerequisite: Mathematics 102. (Credit, full course.) Staff

215. Discrete Mathematical Structures

This course is required for most courses in mathematics or computer science numbered 300 or above. Topics normally include the following: logic, sets, functions, relations, graphs and trees, mathematical induction, combinatorics, recursion, and algebraic structures. The subject matter is of current interest to both mathematics and computer science students. Prerequisite:  Math 101 or higher. (Credit, full course.)  Staff

301. Numerical Analysis

Includes interpolation and curve-fitting, quadrature, iterative methods in linear and non-linear algebra, difference equations, and applications of the above to the approximate solution of ordinary and partial differential equations. Prerequisites: Math 207 and 215. (Credit, full course.) Staff

303. Analysis I

A rigorous treatment of continuity, differentiation, and integration for functions of a real variable. The course also includes convergence of series and sequences of functions as well as topology of the real line. Prerequisites: Math 207 and 215. (Credit, full course.) Priestley

305, 306. Abstract Algebra

A study of these important algebraic structures: integral domains, polynomials, groups, vector spaces, rings and ideals, fields, and elementary Galois theory. Prerequisite: Math 215. (Credit, full course.) Cavagnaro

311. Functions of a Complex Variable

An introduction to analytic functions. Rational, exponential, logarithmic, and trigonometric functions in the complex plane, Cauchy's integral formula, Taylor series, Laurent series, residues, poles, and conformal mapping are considered along with applications to physical problems and other areas of mathematics. Prerequisites: Math 207 and 215. (Credit, full course.) Priestley

313. Algebraic Number Theory

Largely an algebraic study of the standard number-theoretic functions, congruences, primes, quadratic residues, and other topics selected according to the interests of the students and instructor. Prerequisite: Math 215. (Credit, full course.) Priestley

314. Topology

An introduction to point-set topology with emphasis on Euclidean spaces and applications to analysis. Topics include connectedness, compactness, countability conditions, separation properties, metric spaces, continuity, homeomorphisms, and product spaces. Prerequisite: Math 215. (Credit, full course.) Cavagnaro

321, 322. Probability and Statistics

A treatment of probability and a logical development of the framework of mathematical statistics. Topics include random variables, distribution functions, sampling, and statistical inference. Prerequisites: Math 207 and 215. (Credit, full course.) Puckette

330. History of Mathematics

A survey of classical mathematics from ancient times to the development of calculus, together with selected topics from the history of modern mathematics. Prerequisite: Math 102. (Credit, full course.) Priestley

332. Mathematical Modeling

An introduction to the creation of mathematical models, both deterministic and probabilistic, for the description of problems drawn from physical, biological, social, and environmental sources. Prerequisites: Math 215 and 212. (Credit, full course.) Cavagnaro

334. Partial Differential Equations and Modeling

This course addresses the techniques and theory of partial differential equations. Many physical and biological applications and models are explored, including the heat equation, the wave equation, and LaPlace’s equation. Significant attention is given to both theory and applications. Prerequisite: Math 207 and Math 212. (Credit, full course.) Drinen

401. Analysis II

A concentrated study of the theory of functions of a real variable. Abstract methods are emphasized. Students are active participants in the presentation. Prerequisite: Math 303. (Credit, full course.) Priestley

403. Honors Seminar

Study of a selected topic. Participants in the seminar include the mathematics faculty and invited students. (Credit, full course.) Staff

410. Mathematical Methods in Physics (also Physics 410)

Vector spaces and linear operators, with applications. Fourier series, boundary value problems, orthogonal functions. Prerequisites: Math 212. (Credit, full course.) Staff

416. Algebraic Topology

An introduction to algebraic and combinational topology with emphasis on applications to analysis and Euclidean geometry. Topics covered include simplicial homology, the fundamental group, covering spaces, the higher homotopy groups, and the homology sequence. Prerequisite: Math 314. (Credit, full course.) Croom

420. Geometry

Topics in Euclidean and non-Euclidean geometry are discussed. Particular emphasis is on the axiomatic approach in the study of geometry. Prerequisite:  Math 215. (Credit, full course.) Staff

430. Calculus on Manifolds

Multivariable calculus including the inverse and implicit function theorems, manifolds (spaces that locally resemble Euclidean space), differential forms, and Stokes’ Theorem for compact, oriented k-manifolds. Prerequisite: Math 210 and 215, or consent of instructor. (Credit, full course.) Parrish

444. Independent Study

(Credit, half to full course.) Staff

Computer Science Courses

101. Introduction to Computer Science

An introductory survey of computer science designed for liberal arts students, including such topics as machine architecture, language translation, artificial intelligence, and noncomputability. (Credit, full course.) Staff

120. Introduction to Environmental Computing

The course includes an introduction to common software programs used in geographic information systems (GIS) and provides an overview of GIS-related technologies. It also introduces students to a deeper understanding of the Internet as a computing technology and how it can be used best to share environmentally-oriented research and information with the public. The class covers hypertext markup language, basic design, layout, construction, setup and maintenance of a web site as the support structure for online publication of environmental content. Existing environmental web sites provide valuable case studies for analysis and improvement. (Credit, full course.) Dale

157. Introduction to Programming

An introduction to designing algorithmic solutions to problems and implementing algorithms in a programming language. Problem-solving methods emphasize modularity and reliability, and students develop the fundamental programming skills needed for later courses. (Credit, full course.) Dale

180. Business Data Communications and Computer Networks

This course offers a balanced approach between technical and practical aspects of data communications, providing an exploration of how things work as well as how they can be applied to create business solutions. Data communications and computer networks are essential for the functioning of banking systems, financial markets, trade, and local and global businesses, which must manage those systems, plan for technological growth, and reduce the security vulnerabilities that are introduced by those systems. Topics covered include distributed data processing, Internet architecture and protocols, client-server computing, local and wide area networks, wireless communications, and network security. (Credit, full course.) Lankewicz

257. Data Structures

Focuses on data abstraction, algorithm design and analysis, recursion, and the implementation of larger programs. Prerequisite: CSci 157. (Credit, full course.) Staff

270. Computer Organization

Levels of computer organization, processors and related hardware components, instruction sets, program execution. Prerequisite: CSci 157. (Credit, full course.) Staff

276. Multimedia Programming and Design

An introduction to object-oriented programming techniques that underlie the creation, manipulation, and transmission of digital media, including digital photography, audio, and video.  Topics include scaling and transforming pictures, sound waveform visualization and manipulation, MIDI, chromakey, frame-based animation, and compression, encoding, and transmission of digital media over the Internet. Prerequisite: CSci 157 or permission of instructor. (Credit, full course.) Carl

284. Database Design with Web Applications

This course provides students with a working knowledge of the power and potential of modern networked databases as well as of common uses and abuses. Students receive hands-on experience with open source development tools, which are widely used for building and placing databases on the web. Database development is explored, from conceptual elaboration through design and implementation, and interview techniques for effective database design are considered. Programming techniques are introduced for building, maintaining, accessing, interacting, and protecting the information in large data depositories. Discussions include consideration of concerns driving policy decisions for amassing and managing sensitive, and sometimes dangerous, information collections. Prerequisite: CSci 101 or CSci 157. (Credit, full course.) Dale

310. Theory of Computation

An introduction to the theoretical foundations of computing including abstract models of computing machines, the grammars the machines recognize, and classes of languages. Prerequisite: Math 215 and CSci 257. (Credit, full course.) Parrish

320. Analysis of Algorithms

Systematic study of algorithms and their complexity, searching and sorting, pattern matching, geometric and graph algorithms, NP-complete and intractable problems. Prerequisites: Math 215 and CSci 257. (Credit, full course.) Dale, Lankewicz

326. Functional Programming

Data abstraction and data-driven recursion, procedures as values, managing state, syntax expansion, streams, continuations. Prerequisite: CSci 257. (Credit, full course.) Parrish, Carl

344. Robotics

An overview of the field of robotics with special emphasis on motion planning. In addition to basic computer science concepts, introductions to the necessarily related fields of mechanical and electrical engineering are provided as appropriate. Computer simulations are used and students get hands-on experience with "real world" robotics through assignments using project component kits. Prerequisites: CSci 257 and Math 215. (Credit, full course.) Dale

348. Databases

An introduction to the design of databases for the systematic collection, organization, and retrieval of large quantities of related information. The relational data model is used with a design process that begins with conceptual modeling and ends with the physical data organization. The course includes topics such as normalization, SQL, data quality management, implementation issues, database administration, and data warehousing. Prerequisites: CSci 257 and Math 215. (Credit, full course.) Dale

356. Artificial Intelligence

Knowledge representation, expert systems, natural language processing, computer vision, machine learning, game playing, cognition. Prerequisite: CSci 326 or 376. (Credit, full course.) Staff

360. Principles of Interactive Computer Graphics

Introduction to interactive computer graphics including 2D and 3D viewing, clipping, hidden line/surface removal, shading, interaction handling, geometrical transformations, projections, and hierarchical data structures. Brief introductions to related and dependent fields of physically-based modeling and scientific visualization are included. Prerequisites: CSci 257 and Math 215. (Credit, full course.) Dale

376. Programming Languages

Imperative, object-oriented, declarative, and functional programming language paradigms. Prerequisites: Math 215 and CSci 257. (Credit, full course.) Parrish

411. Computer Networks and Architecture

Computer network design and performance, communication protocols, LAN standards, internetworking, congestion control, routing, client/server programming, network security. Prerequisite: CSci 270. (Credit, full course.) Lankewicz

428. Operating Systems

Process management, memory management, processor scheduling, file systems, concurrent programming, distributed processing, security. Prerequisites: Math 215 and CSci 270. (Credit, full course.) Staff

430. Machine Learning

Study of intelligent problem-solving, searching algorithms, inference systems, and machine intelligence. Topics covered include Bayesian decision theory and pattern recognition techniques such as neural networks, genetic algorithms, and traditional artificial intelligence methodologies. Prerequisite: Math 210 and CSci 257. (Credit, full course.) Lankewicz

444. Independent Study

(Credit, half to full course.) Staff

Statistics Courses

204. Elementary Statistics

An introduction to statistics covering these topics: probability, binomial and normal distributions, mean, median, variance, standard deviation, the distinction between sample and population, t-distribution, hypothesis testing, confidence intervals, and linear regression. Not open for credit with Economics 201. Does not satisfy college mathematics requirement. (Credit, full course.) Staff