COM S 311: Introduction to the Design and Analysis of Algorithms
(3-1) Cr. 3. F.S.SS.
Prereq: Minimum of C- in (COM S 228; MATH 166, ENGL 150); (COM S 230 or CPR E 310)
Basic techniques for design and analysis of algorithms. Sorting, searching, graph algorithms, string matching, algorithms for secure computing such as RSA, and NP-completeness. Design techniques such as dynamic programming, divide and conquer, greedy method, and approximation. Asymptotic, worst-case, average-case and amortized analyses. Topics from advanced data structures such as balanced trees and hashing. Programming projects.
The department of Computer Science offers Bachelor of Science and Bachelor of Arts degrees in Computer Science in the College of Liberal Arts and Sciences.