CISC 3220 Analysis of Algorithms
(Prior to Fall 2010, this course was known as CIS 23.
The information below might still reflect the old course numbers. Bracketed numbers, if any, are the old course numbers. Learn more...)
3 hours; 3 credits
Algorithms, data structures, and their analysis. Applications for and solution to recurrence problems. Upper and lower bounds on complexities of various problems. Classification by design structures. Sorting methods, graph and selection algorithms. Pattern matching. Efficient computation of transitive closure and equivalences. NP-completeness.
Prerequisite: Computer and Information Science 2210 ; 21 or 3130 ; Mathematics 3.20 or 1201 [3.3] or 4.10.