Search Results
Your search for courses · during 2024-25 · 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 2024, Winter 2025, Spring 2025
- 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.00 Fall 2024
- Faculty:Layla Oesper 🏫 👤
- Size:34
- M, WAnderson Hall 329 12:30pm-1:40pm
- FAnderson Hall 329 1:10pm-2:10pm
-
29 spots held for students in CS Match until 9:00 a.m. May 24
-
CS 252.02 Winter 2025
- Faculty:Sneha Narayan 🏫 👤
- Size:34
- M, WAnderson Hall 329 11:10am-12:20pm
- FAnderson Hall 329 12:00pm-1:00pm
-
CS 252.00 Spring 2025
- Faculty:Eric Alexander 🏫 👤
- Size:34
- M, WLanguage & Dining Center 104 9:50am-11:00am
- FLanguage & Dining Center 104 9:40am-10:40am
-
34 – reserved for REQ: CS 252 Match (Condition Rule) until 3/5/2025
-
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 2024, Winter 2025, Spring 2025
- 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.00 Fall 2024
- Faculty:Chelsey Edge 🏫 👤
- Size:34
- M, WLanguage & Dining Center 104 11:10am-12:20pm
- FLanguage & Dining Center 104 12:00pm-1:00pm
-
34 spots held for students in CS Match until 9:00 a.m. May 24
-
CS 254.00 Winter 2025
- Faculty:Chelsey Edge 🏫 👤
- Size:34
- M, WWeitz Center 132 11:10am-12:20pm
- FWeitz Center 132 12:00pm-1:00pm
-
MATH 333 Combinatorial Theory 6 credits
The study of structures involving finite sets. Counting techniques, including generating functions, recurrence relations, and the inclusion-exclusion principle; existence criteria, including Ramsey’s theorem and the pigeonhole principle. Some combinatorial identities and bijective proofs. Other topics may include graph and/or network theory, Hall’s (“marriage”) theorem, partitions, and hypergeometric series.
- Winter 2025
- 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 Math 236 Requisite Equivalency exam.