ENROLL Course Search
NOTE: There are some inconsistencies in the course listing data - ITS is looking into the cause.
Alternatives: For requirement lists, please refer to the current catalog. For up-to-the-minute enrollment information, use the "Search for Classes" option in The Hub. If you have any other questions, please email registrar@carleton.edu.
Your search for courses for 20/WI found 1 course.
CS 252.00 Algorithms 6 credits
Closed: Size: 34, Registered: 36, Waitlist: 0
| M | T | W | TH | F |
|---|---|---|---|---|
| 9:50am11:00am | 9:50am11:00am | 9:40am10:40am |
Requirements Met:
Other Tags:
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)
Search for Courses
This data updates hourly. For up-to-the-minute enrollment information, use the Search for Classes option in The Hub