## 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 21/WI and with code: MATHELEC found 11 courses.

### CS 252.00 Algorithms 6 credits

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

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

1:00pm2:10pm | 1:00pm2:10pm | 1:50pm2:50pm |

#### 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

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

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

11:30am12:40pm | 11:30am12:40pm | 11:10am12:10pm |

#### 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.00 Probability 6 credits

Closed: Size: 30, Registered: 21, Waitlist: 0

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

11:30am12:40pm | 11:30am12:40pm | 11:10am12:10pm |

#### Requirements Met:

#### Other Tags:

(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

### MATH 240.02 Probability 6 credits

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

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

11:30am12:40pm | 11:30am12:40pm | 11:10am12:10pm |

#### Requirements Met:

#### Other Tags:

(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

### MATH 241.00 Ordinary Differential Equations 6 credits

Closed: Size: 30, Registered: 27, Waitlist: 0

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

1:00pm2:10pm | 1:00pm2:10pm | 1:50pm2:50pm |

#### Requirements Met:

#### Other Tags:

*Prerequisite:* Mathematics 232 or instructor permission

### MATH 241.02 Ordinary Differential Equations 6 credits

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

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

7:00pm8:10pm | 7:00pm8:10pm | 7:00pm8:00pm |

#### Requirements Met:

#### Other Tags:

*Prerequisite:* Mathematics 232 or instructor permission

### MATH 295.00 Combinatorial Games 6 credits

Closed: Size: 21, Registered: 20, Waitlist: 0

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

10:20am12:05pm | 10:20am12:05pm |

#### Requirements Met:

#### Other Tags:

An introduction to the theory and practice of combinatorial games, which are two-player games in which players take turns, both players have complete information about the state of the game at all times, and there is no chance involved. Topics may include impartial games, a complete solution to nim, nim's relationship with other impartial games, the correspondence between games and numbers, sums of games, birthdays of games, hot games, and thermographs of games. Specific games will be studied as examples of the general theory, possibly including hackenbush, domineering, amazons, chomp, the octal games, and variations of these games.

*Prerequisite:* Mathematics 236 or instructor permission

### MATH 312.00 Elementary Theory of Numbers 6 credits

Closed: Size: 25, Registered: 22, Waitlist: 0

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

1:00pm2:10pm | 1:00pm2:10pm | 1:50pm2:50pm |

#### Requirements Met:

#### Other Tags:

Properties of the integers. Topics include the Euclidean algorithm, classical unsolved problems in number theory, prime factorization, Diophantine equations, congruences, divisibility, Euler's phi function and other multiplicative functions, primitive roots, and quadratic reciprocity. Other topics may include integers as sums of squares, continued fractions, distribution of primes, integers in extension fields, p-adic numbers.

*Prerequisite:* Mathematics 236 or instructor permission

### MATH 321.00 Real Analysis I 6 credits

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

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

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

#### Requirements Met:

#### Other Tags:

*Prerequisite:* Mathematics 236 or instructor permission

### MATH 352.00 Topics in Abstract Algebra 6 credits

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

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

2:30pm3:40pm | 2:30pm3:40pm | 3:10pm4:10pm |

#### Requirements Met:

#### Other Tags:

*Prerequisite:* Mathematics 342

This course can be repeated only by students who took MATH 352 22-23

### STAT 250.00 Introduction to Statistical Inference 6 credits

Closed: Size: 28, Registered: 28, Waitlist: 0

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

2:30pm3:40pm | 2:30pm3:40pm | 3:10pm4:10pm |

#### Requirements Met:

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

*Prerequisite:* Mathematics 240 Probability (formerly Mathematics 265)

### Search for Courses

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