Search Results
Your search for courses · during 26WI · tagged with MATH Electives · returned 10 results
-
CS 252 Algorithms 6 credits
A course on techniques used in the design and analysis of efficient algorithms. We will cover several major algorithmic design paradigms (greedy algorithms, dynamic programming, divide and conquer, and network flow). Along the way, we will explore the application of these techniques to a variety of domains (natural language processing, economics, computational biology, and data mining, for example). As time permits, we will include supplementary topics like randomized algorithms, advanced data structures, and amortized analysis.
- Winter 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): CS 200 with a grade of C- or better or CS 201 with a grade of C- or better or received a Carleton Computer Science 200 Requisite Equivalency AND CS 202 with a grade of C- or better or received a Carleton Computer Science 202 Requisite Equivalency or MATH 236 with a grade of C- or better or received a Carleton Math 236 Requisite Equivalency. MATH 236 will be accepted in lieu of CS 202.
-
CS 252.01 Winter 2026
- Faculty:Chelsey Edge 🏫 👤
- Size:28
- M, WAnderson Hall 036 8:30am-9:40am
- FAnderson Hall 036 8:30am-9:30am
-
24 seats held for CS Match until the day after Sophomore Only priority registration.
-
CS 254 Computability and Complexity 6 credits
An introduction to the theory of computation. What problems can and cannot be solved efficiently by computers? What problems cannot be solved by computers, period? Topics include formal models of computation, including finite-state automata, pushdown automata, and Turing machines; formal languages, including regular expressions and context-free grammars; computability and uncomputability; and computational complexity, particularly NP-completeness.
- Winter 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): CS 200 with a grade of C- or better or CS 201 with a grade of C- or better or received a Carleton Computer Science 200 Requisite Equivalency AND CS 202 with a grade of C- or better or received a Carleton Computer Science 202 Requisite Equivalency or MATH 236 with a grade of C- or better or received a Carleton Math 236 Requisite Equivalency. MATH 236 will be accepted in lieu of CS 202.
-
CS 254.01 Winter 2026
- Faculty:Josh Davis 🏫 👤
- Size:28
- M, WHulings 316 1:50pm-3:00pm
- FHulings 316 2:20pm-3:20pm
-
22 seats held for CS Match until the day after First Year priority registration.
-
MATH 240 Probability 6 credits
Introduction to probability and its applications. Topics include discrete probability, random variables, independence, joint and conditional distributions, expectation, limit laws and properties of common probability distributions.
- Winter 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): MATH 120 or MATH 211 or greater with a grade of C- or better or received a Carleton MATH 211 or better Requisite Equivalency or equivalent.
-
MATH 241 Ordinary Differential Equations 6 credits
Ordinary differential equations are a fundamental language used by mathematicians, scientists, and engineers to describe processes involving continuous change. In this course we develop ordinary differential equations as models of real world phenomena and explore the mathematical ideas that arise within these models. Topics include separation of variables; phase portraits; equilibria and their stability; non-dimensionalization; bifurcation analysis; and modeling of physical, biological, chemical, and social processes.
- Winter 2026
- FSR, Formal or Statistical Reasoning
-
Student must have completed any of the following course(s): MATH 134 or MATH 232 AND MATH 120 or MATH 211 with a grade of C- or better or equivalents.
-
MATH 244 Geometries 6 credits
Euclidean geometry from an advanced perspective; projective, hyperbolic, inversive, and/or other geometries. Recommended for prospective secondary school teachers.
- Winter 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): MATH 236 with a grade of C- or better.
-
MATH 282 Number Theory 6 credits
A first course in number theory, covering properties of the integers. Topics include the Euclidean algorithm, prime factorization, Diophantine equations, congruences, divisibility, Euler’s phi function and other multiplicative functions, primitive roots, and quadratic reciprocity. Along the way we will encounter and explore several famous unsolved problems in number theory. If time permits, we may discuss further topics, including integers as sums of squares, continued fractions, distribution of primes, Mersenne primes, the RSA cryptosystem.
- Winter 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): MATH 236 with a grade of C- or better or received a Carleton Math 236 Requisite Equivalency exam.
-
MATH 342 Abstract Algebra I 6 credits
Introduction to algebraic structures, including groups, rings, and fields. Homomorphisms and quotient structures, polynomials, unique factorization. Other topics may include applications such as Burnside’s counting theorem, symmetry groups, polynomial equations, or geometric constructions.
- Winter 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): MATH 236 with a grade of C- or better or received a Carleton Math 236 Requisite Equivalency exam.
-
MATH 354 Topology 6 credits
An introduction to the study of topological spaces. We develop concepts from point-set and algebraic topology in order to distinguish between different topological spaces up to homeomorphism. Topics include methods of construction of topological spaces; continuity, connectedness, compactness, Hausdorff condition; fundamental group, homotopy of maps.
- Winter 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): MATH 236 with a grade of C- or better or received a Carleton Math 236 Requisite Equivalency exam.
-
MATH 361 Complex Analysis 6 credits
The theoretical foundations for the calculus of functions of a complex variable.
- Winter 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): MATH 321 with a grade of C- or better.
-
STAT 250 Introduction to Statistical Inference 6 credits
Introduction to modern mathematical statistics. The mathematics underlying fundamental statistical concepts will be covered as well as applications of these ideas to real-life data. Topics include: resampling methods (permutation tests, bootstrap intervals), classical methods (parametric hypothesis tests and confidence intervals), parameter estimation, goodness-of-fit tests, regression, and Bayesian methods. The statistical package R will be used to analyze data sets.
- Winter 2026
- FSR, Formal or Statistical Reasoning QRE, Quantitative Reasoning
-
Student has completed any of the following course(s): MATH 240 with a grade of C- or better.