Analysis of Algorithms

Catalog description

Introduction to design and analysis of combinatorial algorithms. Use of asymptotics in evaluating algorithm’s efficiency and scalability. Application of induction and other mathematical techniques for proving correctness of algorithms. Data structures for simplifying algorithm design, such as hash tables, heaps, binary search trees. Advanced design and analysis methods, such as greedy algorithms, dynamic programming, amortized analysis. Prerequisite(s): CSCI 3400 >=C and CSCI 3030 >=C Lecture Hours: 3 Repeatability: May not be repeated for credit. Grade Mode: N- Normal (A, B, C, D, F) Schedule Type (Primary): Lecture Click here for the Schedule of Classes.