ENROLL Course Search

Saved Courses (0)

Your search for courses for 22/SP and with code: MATHELEC found 12 courses.

Revise Your Search New Search

CS 252.00 Algorithms 6 credits

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

CMC 301

MTWTHF
8:30am9:40am8:30am9:40am8:30am9:30am
Synonym: 60522

David Liben-Nowell

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: 35, Waitlist: 0

Anderson Hall 329

MTWTHF
11:10am12:20pm11:10am12:20pm12:00pm1:00pm
Synonym: 62543

James O Ryan

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)

CS 352.00 Advanced Algorithms 6 credits

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

Leighton 304

MTWTHF
11:10am12:20pm11:10am12:20pm12:00pm1:00pm
Synonym: 62001

David Liben-Nowell

A second course on designing and analyzing efficient algorithms to solve computational problems. We will survey some algorithmic design techniques that apply broadly throughout computer science, including discussion of wide-ranging applications. A sampling of potential topics: approximation algorithms (can we efficiently compute near-optimal solutions even when finding exact solutions is computationally intractable?); randomized algorithms (does flipping coins help in designing faster/simpler algorithms?); online algorithms (how do we analyze an algorithm that needs to make decisions before the entire input arrives?); advanced data structures; complexity theory. As time and interest permit, we will mix recently published algorithmic papers with classical results.

Prerequisite: Computer Science 252 or instructor permission

MATH 241.00 Ordinary Differential Equations 6 credits

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

CMC 210

MTWTHF
12:30pm1:40pm12:30pm1:40pm1:10pm2:10pm
Synonym: 61643

Rob C Thompson

An introduction to ordinary differential equations, including techniques for finding solutions, conditions under which solutions exist, and some qualitative analysis.

Prerequisite: Mathematics 232 or instructor permission

MATH 244.00 Geometries 6 credits

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

CMC 206

MTWTHF
9:50am11:00am9:50am11:00am9:40am10:40am
Synonym: 62565

MurphyKate Montee

Euclidean geometry from an advanced perspective; projective, hyperbolic, inversive, and/or other geometries. Recommended for prospective secondary school teachers.

Prerequisite: Mathematics 236

MATH 295.00 Mathematics of Climate 6 credits

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

CMC 206

MTWTHF
1:15pm3:00pm1:15pm3:00pm

Other Tags:

Synonym: 61271

Kate J Meyer

An introduction to mathematical methods for studying planetary climate. The focus will be on low-dimensional models, whose simplicity allows insight into fundamental mechanisms of climate change. We will use tools from algebra, geometry, and calculus to study topics including energy balance, greenhouse gas forcing, and ice-albedo feedback. This course will count towards the Applied Math area of the math major.

Prerequisite: Mathematics 120 or 211

Sophomore Priority

MATH 321.00 Real Analysis I 6 credits

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

CMC 209

MTWTHF
11:10am12:20pm11:10am12:20pm12:00pm1:00pm
Synonym: 61645

Alex J Barrios

A systematic study of concepts basic to calculus, such as topology of the real numbers, limits, differentiation, integration, convergence of sequences, and series of functions.

Prerequisite: Mathematics 236 or instructor permission

MATH 341.00 Partial Differential Equations 6 credits

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

CMC 210

MTWTHF
1:50pm3:00pm1:50pm3:00pm2:20pm3:20pm
Synonym: 61646

Rob C Thompson

An introduction to partial differential equations with emphasis on the heat equation, wave equation, and Laplace's equation. Topics include the method of characteristics, separation of variables, Fourier series, Fourier transforms and existence/uniqueness of solutions.

Prerequisite: Mathematics 241

MATH 352.00 Topics in Abstract Algebra 6 credits

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

CMC 319

MTWTHF
9:50am11:00am9:50am11:00am9:40am10:40am
Synonym: 61647

Mark Krusemeyer

An intensive study of one or more of the types of algebraic systems studied in Mathematics 342.

Prerequisite: Mathematics 342

This course can be repeated

MATH 361.00 Complex Analysis 6 credits

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

CMC 206

MTWTHF
10:10am11:55am10:10am11:55am
Synonym: 61648

Owen D Biesel

The theoretical foundations for the calculus of functions of a complex variable.

Prerequisite: Mathematics 321 or instructor permission. Students who have already received credit for Mathematics 261 may only take this course with instructor permission

STAT 250.00 Introduction to Statistical Inference 6 credits

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

CMC 206

MTWTHF
12:30pm1:40pm12:30pm1:40pm1:10pm2:20pm
Synonym: 61553

Laura M Chihara

(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)

Formerly Mathematics 275

STAT 320.00 Time Series Analysis 6 credits

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

CMC 319

MTWTHF
1:50pm3:00pm1:50pm3:00pm2:20pm3:20pm
Synonym: 61554

Andy N Poppick

(Formerly MATH 315) Models and methods for characterizing dependence in data that are ordered in time. Emphasis on univariate, quantitative data observed over evenly spaced intervals. Topics include perspectives from both the time domain (e.g., autoregressive and moving average models, and their extensions) and the frequency domain (e.g., periodogram smoothing and parametric models for the spectral density).

Prerequisite: Statistics 230 and 250 (formerly Mathematics 245 and 275). Exposure to matrix algebra may be helpful but is not required

Formerly 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

Instructional Mode
Class Period
Courses or labs meeting at non-standard times may not appear when searching by class period.
Requirements
You must take 6 credits of each of these.
Overlays
You must take 6 credits of each of these,
except Quantitative Reasoning, which requires 3 courses.
Special Interests