Algorithm and Data Structure Analysis

Catalog description

This course will cover the analysis of algorithms that can be used in different computer functions such as sorting, searching, string matching, and graph-theoretic algorithms. The course also covers different methods for effectively using data structures in computer applications. This is achieved through the analysis and estimation of the data structures and corresponding Big-O, Big Omega, and Big Theta run-time rates. The course will also cover analysis to determine in advance that no efficient algorithms exist for those classes of algorithms where no efficient algorithms exist. The theory of (NP-completeness) will be introduced and applied to these algorithms. The course will also include practical programming projects that empirically compare and contrast algorithm performance.