Computer Science 311 - Introduction to Algorithms
Spring
2026
01AB
F 9:05AM 9:55AM
UMass Amherst
85093
Marston Hall room 211
Design and analysis of efficient algorithms for important computational problems. Emphasis on the relationships between algorithms and data structures, measures of algorithmic efficiency, reasoning about correctness. Graph algorithms, design strategies (greedy, divide and conquer, dynamic programming), intractability. Use of computer required.
Open to junior and senior COMPSCI students or Math majors in the MATHCMPTNG subplan. CS187/CICS210&CS250/MATH455wC
Multiple required components--lab and/or discussion section. To register, submit requests for all components simultaneously.