Search Results
Your search for courses · during 25FA, 26WI, 26SP · tagged with MATH Discrete Structures · returned 2 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 2025, Winter 2026, Spring 2026
- 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.01 Fall 2025
- Faculty:Sneha Narayan 🏫 👤
- Size:28
- M, WAnderson Hall 329 1:50pm-3:00pm
- FAnderson Hall 329 2:20pm-3:20pm
-
21 seats held for CS Match until the day after rising sophomore (only) priority registration.
-
CS 252.01 Winter 2026
- Faculty:Chelsey Edge 🏫 👤
- Size:28
- M, WAnderson Hall 036 8:30am-9:40am
- FAnderson Hall 036 8:30am-9:30am
-
24 seats held for CS Match until the day after Sophomore Only priority registration.
-
CS 252.01 Spring 2026
- Faculty:Eric Alexander 🏫 👤
- Size:28
- M, WAnderson Hall 329 9:50am-11:00am
- FAnderson Hall 329 9:40am-10:40am
-
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 2025, Winter 2026, Spring 2026
- 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.01 Winter 2026
- Faculty:Josh Davis 🏫 👤
- Size:28
- M, WHulings 316 1:50pm-3:00pm
- FHulings 316 2:20pm-3:20pm
-
22 seats held for CS Match until the day after First Year priority registration.
-
CS 254.01 Spring 2026
- Faculty:Chelsey Edge 🏫 👤
- Size:28
- M, WLanguage & Dining Center 104 12:30pm-1:40pm
- FLanguage & Dining Center 104 1:10pm-2:10pm
-
CS 254.02 Spring 2026
- Faculty:Anna Rafferty 🏫 👤
- Size:28
- M, WLeighton 305 9:50am-11:00am
- FLeighton 305 9:40am-10:40am