Search Results

COM S 311: Design and Analysis of Algorithms

(3-1) Cr. 3.

Prereq: Minimum of C- in COM S 228; MATH 166, ENGL 150, and COM S 230 or CPR E 310
Basic techniques for design and analysis of efficient algorithms. Sorting, searching, graph algorithms, computational geometry, string processing and NP-completeness. Design techniques such as dynamic programming and the greedy method. Asymptotic, worst-case, average-case and amortized analyses. Data structures including heaps, hash tables, binary search trees and red-black trees. Programming projects.

Computer Science

...Com S 228. A minimum grade of C is required in both Com S 311...