Modify Your Search
Search Results
Your search for courses · during 2025-26 · tagged with MATH Discrete Structures · returned 3 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 2026, Winter 2027, Spring 2027
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): CS 200 or CS 201 with a grade of C- or better or received a Carleton Computer Science 200 Requisite Equivalency AND CS 202 or MATH 236 with a grade of C- or better or received a Carleton Computer Science 202 Requisite Equivalency or received a Carleton Math 236 Requisite Equivalency. MATH 236 will be accepted in lieu of CS 202.
-
CS 252.01 Fall 2026
- Faculty: Sneha Narayan 🏫 👤
- Size:28
- M, WWillis 204 12:30pm-1:40pm
- FWillis 204 1:10pm-2:10pm
-
19 Seats held for CS Match until the day after rising sophomore priority registration.
Anticipated prefect-supported section.
-
CS 252.01 Winter 2027
- Faculty: Eric Alexander 🏫 👤
- Size:28
- M, WHulings 316 9:50am-11:00am
- FHulings 316 9:40am-10:40am
-
x Seats held for CS Match until the day after X priority registration.
Anticipated prefect-supported section.
-
CS 252.01 Spring 2027
- Faculty: Sneha Narayan 🏫 👤
- Size:28
- M, WAnderson Hall 329 1:50pm-3:00pm
- FAnderson Hall 329 2:20pm-3:20pm
-
x Seats held for CS Match until the day after X priority registration.
Anticipated prefect-supported section.
-
CS 252.02 Spring 2027
- Faculty: Chelsey Edge 🏫 👤
- Size:28
- M, WLanguage & Dining Center 104 9:50am-11:00am
- FLanguage & Dining Center 104 9:40am-10:40am
-
x Seats held for CS Match until the day after X priority registration.
Anticipated prefect-supported section.
-
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 2026, Winter 2027, Spring 2027
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): CS 200 or CS 201 with a grade of C- or better or received a Carleton Computer Science 200 Requisite Equivalency AND CS 202 or MATH 236 with a grade of C- or better or received a Carleton Computer Science 202 Requisite Equivalency or received a Carleton Math 236 Requisite Equivalency. MATH 236 will be accepted in lieu of CS 202.
-
CS 254.01 Fall 2026
- Faculty: Chelsey Edge 🏫 👤
- Size:28
- M, WAnderson Hall 036 8:30am-9:40am
- FAnderson Hall 036 8:30am-9:30am
-
7 Seats held for CS Match until the day after rising junior priority registration.
Anticipated prefect-supported section.
-
CS 254.01 Winter 2027
- Faculty: Josh Davis 🏫 👤
- Size:28
- M, WWillis 204 1:50pm-3:00pm
- FWillis 204 2:20pm-3:20pm
-
x Seats held for CS Match until the day after X priority registration.
Anticipated prefect-supported section.
-
CS 254.01 Spring 2027
- Faculty: Layla Oesper 🏫 👤
- Size:28
- M, WHulings 316 12:30pm-1:40pm
- FHulings 316 1:10pm-2:10pm
-
x Seats held for CS Match until the day after X priority registration.
Anticipated prefect-supported section.
-
MATH 295 Error-Correcting Codes 6 credits
This course explores the mathematics behind error-correcting codes – the science of transmitting information reliably over noisy channels. How can a message be recovered after it has been corrupted in transit? How much redundancy must be introduced to guarantee accurate transmission? A "code" here refers to a carefully designed set of codewords, strings of symbols built to withstand errors. Codes of this kind are everywhere: they underpin QR codes, ISBN numbers, and solid-state drives. We begin with the fundamental ideas of error detection and correction before developing the theory of linear codes, the central objects of study, with examples including Hamming, Golay, and Reed-Muller codes. The course is proof-based, and all necessary background in finite fields and linear algebra is developed within the course.
Repeatable: Course is repeatable provided the topics are different.
- Winter 2027
- 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.