Search Results
Your search for · CS 252 · during 25SP · 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 2025
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): CS 200 – Data Structures with Problem Solving or CS 201 – Data Structures AND CS 202 – Mathematics of Computer Science or MATH 236 – Mathematical Structures with a grade of C- or better or equivalent. MATH 236 will be accepted in lieu of Computer Science 202.
-
CS 252.00 Spring 2025
- Faculty:Eric Alexander 🏫 👤
- Size:34
- M, WHulings 316 9:50am-11:00am
- FHulings 316 9:40am-10:40am