Covers the detailed comparative analysis of algorithms and their computational complexity. May also include formal language theory including finite automata, Turning machines, context-free grammars, and decidability. Prerequisite: MATH 210 and (CSC 122 or ITSC 122).
Copyright © by the contributing authors. All material on this collaboration platform is the property of the contributing authors. Ideas, requests, problems regarding Foswiki? Send feedback
This website is using cookies. More info.
That's Fine