Computer Science 311 - Introduction to Algorithms
Fall
2017
01AB
0.00
F 11:15AM 12:05PM
UMass Amherst
35454
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 250 or MATH 455 w/ C
Multiple required components--lab and/or discussion section. To register, submit requests for all components simultaneously.