Section Info: COMSC-312-01

Course Title: Algorithms
Start Date: 09/04/2019 End Date: 12/17/2019
Term: Fall Semester 2019
Description: How does Google Maps 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 explore graph algorithms, greedy algorithms, divide-and-conquer, dynamic programming, and network flow. Students learn to recognize when to apply each of these strategies as well as to evaluate the expected runtime costs of the algorithms they design.
Distribution(s): II - Math & Sciences
Academic Level Of Course: Undergraduate     Credits:4.00    

Faculty         Phone         Email address        
Audrey Lee St. John   413-538-2509   astjohn@mtholyoke.edu  

Meeting Dates         Method         Meeting days         Meeting times         Building name         Room     Frequency    
09/04/2019 - 12/17/2019   Lecture   Monday and Wednesday   11:00AM - 12:15PM   KNDD - Kendade   303   Weekly
09/04/2019 - 12/17/2019   Fourth Hour of Class   Friday   11:00AM - 11:50AM   KNDD - Kendade   303   Weekly

REGISTRATION DETAILS

Requisite Courses        
Prereq: COMSC-205 and MATH-232. Take previously   Required  

Comments        
Additional Comments        
Course Tags        
NXDTA0001   NXDTA: Nexus in Data Analytics and Society   This course is approved for the Data Analytics  

Cross-listed Sections        
None  

Course Availability
Section status: Open     Capacity: 28     Enrollment: 26     Available: 2     Waitlist: 0

BOOK INFORMATION

Book List         Required         Publisher Full Price        
To be determined.                    

Additional Book Comments        
This is NOT the complete book list for this class.