CS341 Algorithms Analysis and Design
The course explores algorithms analysis in terms of time complexity and memory (space) complexity. The estimation of the complexity of algorithms will be presented. Polynomial vs NP complete algorithms will be discussed. Algorithm design will be covered as design paradigms, brute force, divide and conquer algorithms, dynamic programming algorithms, greedy algorithms, graph searching and traversal. (Prerequisites: CS242)
Prerequisite
Data Structures (
CS242)
Notes
This course may be offered online through a consortium of accredited colleges and universities or in seat at Adrian College. Online instruction may be provided by faculty employed by partner institutions within the consortium, with technology and administrative support provided by Rize Education.
Oversight of courses offered through the consortium are reviewed and approved by Adrian College. Students register through Adrian College and receive academic credit from Adrian College.