| Course Title: Algorithms |
| Start Date: 01/19/2021 End Date: 03/12/2021 |
| Term: Spring Semester 2021 |
| 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 |
| 01/19/2021 - 03/12/2021 | Flex. Immersive Lecture | Monday | 09:45AM - 11:00AM | TBA | TBA | Weekly |
| 01/19/2021 - 03/12/2021 | Flex. Immersive Lecture | Tuesday and Thursday | 09:30AM - 11:15AM | Weekly | ||
| 01/19/2021 - 03/12/2021 | Flex. Immersive Lecture | Wednesday and Friday | 10:15AM - 11:15AM | Weekly |
| 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 |
| MOD0001 | MOD-1: Courses meeting in Module 1 | This course meets in Module 1. |
| MEET0004 | +MEET-4: Expects to meet 4 days per week, on average | This class is expected to meet 4 days per week, on average |
| Cross-listed Sections |
| None |
| Course Availability | ||||
| Section status: Closed | Capacity: 18 | Enrollment: 18 | Available: 0 | 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. |