Computer Science 311 - Intro To Algorithms

Spring
2014
01
4.00
Ramesh Sitaraman
TU TH 9:30AM 10:45AM
UMass Amherst
53725
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 CS MINORS, APPLICANTS-ON-CONTRACT, AND OTHERS NOT MEETING ELIGIBILITY, OR STUDENTS NEEDING SPECIAL PERMISSION MUST REQUEST OVERRIDES VIA THE ON-LINE FORM: https://www.cs.umass.edu/overrides.
Multiple required components--lab and/or discussion section. To register, submit requests for all components simultaneously.
Permission is required for interchange registration during all registration periods.