Computer Science 253 - Applied Algorithms
APPLIED ALGORITHMS
Spring
2021
01
4.00
Ileana Streinu
MWF 09:20-10:35
Smith College
30645-S21
istreinu@smith.edu
Covers advanced data structures and algorithms with an emphasis on object-oriented implementation,
comparative efficiency analysis and applications. A variety of algorithmic approaches will be discussed (divide-and-conquer, dynamic programming, greedy algorithms, graph traversal). We'll go beyond classical searching and sorting to graphs and networks and other applied problems, as well as a selection of NP-hard ones. Prerequisites: CSC 111, CSC 212, MTH 153 (Discrete), MTH 111 (Calculus I) or other math course beyond it.
comparative efficiency analysis and applications. A variety of algorithmic approaches will be discussed (divide-and-conquer, dynamic programming, greedy algorithms, graph traversal). We'll go beyond classical searching and sorting to graphs and networks and other applied problems, as well as a selection of NP-hard ones. Prerequisites: CSC 111, CSC 212, MTH 153 (Discrete), MTH 111 (Calculus I) or other math course beyond it.