Computer Science 311 - Intro To Algorithms
Fall
2012
01
4.00
Philip Thomas
TU TH 2:30PM 3:45PM
UMass Amherst
73769
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. Pre Req: CMPSCI 250orMATH 455
Multiple required components--lab and/or discussion section. To register, submit requests for all components simultaneously.