Computer Science 311 - Introduction to Algorithms
Fall
2025
01AB
F 11:15AM 12:05PM
UMass Amherst
61459
Hasbrouck Lab Add room 113
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 sophomores, juniors, and seniors majoring in Computer Science, Informatics, Computational Linguistics, or Math majors in the Mathematical Computing subplan. CS187/CICS210&CS250/MATH455wC
Multiple required components--lab and/or discussion section. To register, submit requests for all components simultaneously.