Computer Science 311 - Introduction to Algorithms
Spring
2016
01AB
0.00
W 10:10AM 11:00AM
UMass Amherst
70226
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. Prerequisite: CMPSCI 250.
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.