Theory of Algorithms

Formal properties of algorithms are covered here. The use of big O notation is covered, along with its use in algorithm analysis. Other topics include recursion, finite automata, secure computing principles and algorithms and NP complete problems. Examples of several routine algorithms such as searching and sorting are done and assigned as programming projects.

Credits

3 credits

Course Code

CS 425