Algorithms

Semester: 
Spring
Year: 
2019
Subject Name: 
Computer Science
Course Number: 
312
Institution: 
Mount Holyoke College
How does Mapquest find the best route between two locations? How do computers help to decode the human genome? At the heart of these and other complex computer applications are nontrivial algorithms. While algorithms must be specialized to an application, there are some standard ways of approaching algorithmic problems that tend to be useful in many applications. Among other topics, we will explore graph algorithms, greedy algorithms, divide-and-conquer, dynamic programming, and network flow. We will learn to recognize when to apply each of these strategies as well as to evaluate the expected runtime costs of the algorithms we design.
Comments: 
Prereq: COMSC-211 and MATH-232.
Instructor Permission: 
Permission is required for interchange registration during the add/drop period only.
https://wadv1.mtholyoke.edu/wadvg/mhc?TYPE=P&PID=ST-XWSTS12A
Schedule #: 
106642

Course Sections

Algorithms
Sect # Credits Instructor(s) Instructor Email Meeting Times Location
01 4.0 Barbara Lerner blerner@mtholyoke.edu MW 11:00AM-12:15PM;F 11:00AM-11:50AM Kendade 303;Kendade 303