|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
An introduction to basic probability concepts: sample spaces, probability assignments, combinatorics, conditional probability, independence, random variables, discrete and continuous distributions, functions of random variables, expectation, variance, moment-generating functions, some basic probability processes, and some fundamental limit theorems. Prerequisite: Mathematics 137 (recommended but not required: Mathematics 237). Every fall. (4 credits)
-
3.00 Credits
An introduction to the mathematical theory of statistics: sampling distributions, estimation, hypothesis testing, regression. Additional topics may include: analysis of variance and goodness of fit. Emphasis on the theory underlying statistics, not on applications. Prerequisites: Mathematics 354. Every spring. (4 credits)
-
3.00 Credits
A discussion of the basic theoretical foundations of computation as embodied in formal models and descriptions. The course will cover finite state automata, regular expressions, formal languages, Turing machines, computability and unsolvability, and the theory of computational complexity. Introduction to alternate models of computation and recursive function theory. Prerequisite: Computer Science 124, Mathematics 136, or permission of the instructor. Every spring. (4 credits)
-
3.00 Credits
Techniques and algorithms for computational solutions to scientific problems with applications to diverse disciplines. Topics include: numerical integration; root finding; interpolation, splines, and Bezier curves; statistical function estimation; modeling via simulation and Monte Carlo techniques; optimization; transforms; symbolic computing; controlling numerical error. Prerequisites: Computer Science 121 or 123, Math 137. Linear Algebra (Math 236) strongly recommended. Every spring. (4 credits)
-
3.00 Credits
Topics in applied mathematics chosen from: cryptography; complexity theory and algorithms; integer programming; combinatorial optimization; computational number theory; applications of geometry to tilings, packings, and crystallography; applied algebra. Prerequisites: Math 236 and 379 and Computer Science 121 or 123. Alternate fall semesters; next offered Fall 2008. (4 credits)
-
3.00 Credits
Topics in geometry selected by the instructor. Possible courses include classical Euclidean and non-Euclidean geometry (Hilbert's axioms; parallel postulate; hyperbolic, elliptic, spherical, projective geometries; Poincare models), differential geometry (calculus on surfaces; curvature; minimal surfaces; geodesics; the Gauss-Bonet theorem), computational geometry (triangulation; point location; Voronoi diagrams; linear programming). Prerequisite: Mathematics 236 and Mathematics 237. Alternate spring semesters; next offered Spring 2010. (4 credits)
-
3.00 Credits
An introduction to the properties of and unsolved problems about the integers (whole numbers). This course is built around the problem of proving that a large integer is prime or finding its factorization into primes. Topics include: divisibility and prime numbers, the Euclidean algorithm, modular arithmetic, quadratic residues, continued fractions, and public-key cryptosystems. Prerequisite: Mathematics 136. Alternate fall semesters; next offered Fall 2010. (4 credits)
-
3.00 Credits
Introduction to abstract algebraic theory with emphasis on finite groups, rings, fields, constructibility, introduction to Galois theory. Prerequisite: Mathematics 136 and 236. Every spring. (4 credits)
-
3.00 Credits
Basic theory for the real numbers and the notions of limit, continuity, differentiation, integration, convergence, uniform convergence, and infinite series. Additional topics may include metric and normed linear spaces, point set topology, analytic number theory, Fourier series. Prerequisite: Mathematics 237. Every fall. (4 credits)
-
3.00 Credits
Advanced counting techniques. Topics in graph theory, combinatorics, graph algorithms, and generating functions. Applications to other areas of mathematics as well as modeling, operations research, computer science and the social sciences. Prerequisites: Mathematics 136, Computer Science 121 or 123 or the equivalent. Alternate fall semesters; next offered Fall 2009. (4 credits) All 400-level courses will involve some independent student work such as oral presentations, papers, or computer projects.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Cookies Policy |
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|