## ENROLL Course Search

**NOTE:** There are some inconsistencies in the course listing data - ITS is looking into the cause.

**Alternatives:** For requirement lists, please refer to the current catalog. For up-to-the-minute enrollment information, use the "Search for Classes" option in The Hub. If you have any other questions, please email registrar@carleton.edu.

Your search for courses for 22/FA and with code: MATHELEC found 10 courses.

### CS 252.00 Algorithms 6 credits

Open: Size: 34, Registered: 28, Waitlist: 0

M | T | W | TH | F |
---|---|---|---|---|

11:10am12:20pm | 11:10am12:20pm | 12:00pm1:00pm |

#### Requirements Met:

#### Other Tags:

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.

*Prerequisite:* Computer Science 201 and Computer Science 202 (Mathematics 236 will be accepted in lieu of Computer Science 202)

### CS 254.00 Computability and Complexity 6 credits

Closed: Size: 34, Registered: 29, Waitlist: 0

M | T | W | TH | F |
---|---|---|---|---|

9:50am11:00am | 9:50am11:00am | 9:40am10:40am |

#### Requirements Met:

#### Other Tags:

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.

*Prerequisite:* Computer Science 201 and Computer Science 202 (Mathematics 236 will be accepted in lieu of Computer Science 202)

### MATH 240.01 Probability 6 credits

Open: Size: 30, Registered: 20, Waitlist: 0

M | T | W | TH | F |
---|---|---|---|---|

8:30am9:40am | 8:30am9:40am | 8:30am9:30am |

#### Requirements Met:

(Formerly Mathematics 265) 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.

*Prerequisite:* Mathematics 120 or Mathematics 211

Formerly Mathematics 265

### MATH 240.02 Probability 6 credits

Open: Size: 30, Registered: 29, Waitlist: 0

M | T | W | TH | F |
---|---|---|---|---|

9:50am11:00am | 9:50am11:00am | 9:40am10:40am |

#### Requirements Met:

(Formerly Mathematics 265) 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.

*Prerequisite:* Mathematics 120 or Mathematics 211

Formerly Mathematics 265

### MATH 241.00 Ordinary Differential Equations 6 credits

Open: Size: 30, Registered: 20, Waitlist: 0

M | T | W | TH | F |
---|---|---|---|---|

11:10am12:20pm | 11:10am12:20pm | 12:00pm1:00pm |

#### Requirements Met:

#### Other Tags:

*Prerequisite:* Mathematics 232 or instructor permission

### MATH 282.00 Elementary Theory of Numbers 6 credits

Open: Size: 25, Registered: 21, Waitlist: 0

M | T | W | TH | F |
---|---|---|---|---|

1:50pm3:00pm | 1:50pm3:00pm | 2:20pm3:20pm |

#### Requirements Met:

#### Other Tags:

A first course in number 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.

*Prerequisite:* Mathematics 236 or instructor permission

Formerly Math 312

### MATH 342.00 Abstract Algebra I 6 credits

Open: Size: 23, Registered: 20, Waitlist: 0

M | T | W | TH | F |
---|---|---|---|---|

9:50am11:00am | 9:50am11:00am | 9:40am10:40am |

#### Requirements Met:

#### Other Tags:

*Prerequisite:* Mathematics 236 or instructor permission

### MATH 344.00 Differential Geometry 6 credits

Open: Size: 25, Registered: 9, Waitlist: 0

M | T | W | TH | F |
---|---|---|---|---|

12:30pm1:40pm | 12:30pm1:40pm | 1:10pm2:10pm |

#### Requirements Met:

#### Other Tags:

*Prerequisite:* Mathematics 236 or permission of the instructor.

### MATH 395.00 Geometric Group Theory 6 credits

Open: Size: 15, Registered: 7, Waitlist: 0

M | T | W | TH | F |
---|---|---|---|---|

11:10am12:20pm | 11:10am12:20pm | 12:00pm1:00pm |

#### Requirements Met:

#### Other Tags:

Geometric group theory is the study of (infinite) groups using geometric tools. The underlying principle of geometric group theory is that if a group G acts "nicely" on a space, then information about that space tells us information about the group. This class will introduce tools from topology, graph theory, and geometry and use them to study groups. Topics will include groups acting on trees and (more generally) hyperbolic groups. This course counts toward the Algebra area of the math major.

*Prerequisite:* Mathematics 342 or instructor consent

### STAT 340.00 Bayesian Statistics 6 credits

Open: Size: 20, Registered: 18, Waitlist: 0

M | T | W | TH | F |
---|---|---|---|---|

1:50pm3:00pm | 1:50pm3:00pm | 2:20pm3:20pm |

#### Requirements Met:

#### Other Tags:

Formerly MATH 315) An introduction to statistical inference and modeling in the Bayesian paradigm. Topics include Bayes’ Theorem, common prior and posterior distributions, hierarchical models, Markov chain Monte Carlo methods (e.g., the Metropolis-Hastings algorithm and Gibbs sampler) and model adequacy and posterior predictive checks. The course uses R extensively for simulations.

*Prerequisite:* Statistics 250 (formerly Mathematics 275)

Fomerly Mathematics 315

### Search for Courses

This data updates hourly. For up-to-the-minute enrollment information, use the Search for Classes option in The Hub