Design and Analysis of Algorithms

Catalog description

This graduate course provides students with a foundational knowledge in the design and analysis of algorithms. Students will make use of appropriate data structures. Complexity and analysis of algorithms will be completed focusing on worst case and average case, lower bounds, NP-completeness, and recurrences. Students will explore the complexity of appropriate searching, sorting, and graphing algorithms. Prerequisite: CSC505 Principles of Software Development