CSC420Description < Assessment

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. 3 lectures a week. Prerequisite: MATH 210 and (CSC 122 or ITSC 122).

This topic: Assessment > CenterForComputing > AllForSyllabi > CSC420Description
Topic revision: r1 - 2021-07-14 - cathybareiss