Modify Your Search
Search Results
Your search for · CS 252 · during 27SP · returned 1 result
-
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.
- 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 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.