Search Results
Your search for courses · during 24FA · tagged with MATH Electives · returned 7 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.
- Fall 2024
- 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.00 Fall 2024
- Faculty:Layla Oesper 🏫 👤
- Size:34
- M, WAnderson Hall 329 12:30pm-1:40pm
- FAnderson Hall 329 1:10pm-2:10pm
-
29 spots held for students in CS Match until 9:00 a.m. May 24
-
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.
- Fall 2024
- 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.00 Fall 2024
- Faculty:Chelsey Edge 🏫 👤
- Size:34
- M, WLanguage & Dining Center 104 11:10am-12:20pm
- FLanguage & Dining Center 104 12:00pm-1:00pm
-
34 spots held for students in CS Match until 9:00 a.m. May 24
-
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.
- Fall 2024
- 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.
- Fall 2024
- 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 295 Numerical Differential Equations 6 credits
An introduction to numerical methods to compute approximate solutions of differential equations. Material will be selected from a range of topics such as error analysis, numerical differentiation, Euler and Runge-Kutta methods, predictor-corrector methods, boundary value problems, and curve fitting. Applications to other subjects such as physics, chemistry, ecology, epidemiology and neuroscience will be covered. Programming experience is not required.
- Fall 2024
- FSR, Formal or Statistical Reasoning QRE, Quantitative Reasoning
-
Student has completed any of the following course(s): MATH 134 or MATH 232 with a grade of C- or better or received a score of 232 or better on the Carleton Math Requisite Equivalency exam.
-
MATH 342 Introduction to Groups, Rings, and Fields 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.
- Fall 2024
- 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 Mathematics 236 Requisite Equivalency.
-
MATH 344 Differential Geometry 6 credits
Differential geometry is the study of shapes (like curves and surfaces) using tools from linear algebra and calculus. In this course we focus on the differential geometry of curves and surfaces and the concepts of curvature, geodesics, and first and second fundamental forms. These concepts will lead us to remarkable results like the Theorem Egregium and the Gauss-Bonnet Theorem, which relate the ways that curvature and shape interact.
- Fall 2024
- 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 Mathematics 236 Requisite Equivalency.