ALGORITHM DESIGN AND ANALYSIS

Catalog description

Study of asymptotic analysis of mathematical expressions and strategies to derive closed-form solutions of recurrence equations, Intractability, NP-completeness, and their application to estimating the runtime or space requirements of algorithms. Strategies for designing correct and efficient algorithms. Emphasis on the study of algorithms for sorting, searching, string processing, operations on graphs, optimization problems, and numerical processes.