Computer Science 311 - Introduction to Algorithms

Spring
2018
01AA
0.00
F 10:10AM 11:00AM
UMass Amherst
55417
The design and analysis of efficient algorithms for important computational problems. Emphasis on the relationships between algorithms and data structures and on measures of algorithmic efficiency. Sorting (heapsort, mergesort, quicksort), searching, graph algorithms. Experimental analysis of algorithms also emphasized. Use of computer required.
Open to Computer Science majors only. COMPSCI 187 & 250/MATH 455 w/C
Multiple required components--lab and/or discussion section. To register, submit requests for all components simultaneously.
Permission is required for interchange registration during the add/drop period only.