Computer Science 311 - Introduction to Algorithms
Spring
2025
99AD
F 10:10AM 11:00AM
UMass Amherst
44860
Lederle Grad Res Tower rm 121
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 Senior, Junior or Sophmore Computer Science majors only. CS187/CICS210&CS250/MATH455wC
Multiple required components--lab and/or discussion section. To register, submit requests for all components simultaneously.