COMS 3110: Introduction to the Design and Analysis of Algorithms
Credits: 3. Contact Hours: Lecture 3, Discussion 1.
Prereq: (COMS 2300 or CPRE 3100) and (Minimum of C- in COMS 2280, ENGL 1500, and MATH 1660)
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.
(Typically Offered: Fall, Spring, Summer)