Computer Science 311 - Introduction to Algorithms
Spring
2018
01
4.00
Akshay Krishnamurthy
M W 4:00PM 5:15PM
UMass Amherst
55416
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 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.cics.umass.edu/overrides.
Multiple required components--lab and/or discussion section. To register, submit requests for all components simultaneously.