Difference: CSC420Description (1 vs. 2)

Revision 22025-07-31 - CathyBareiss

Line: 1 to 1
 
META TOPICPARENT name="CenterForComputing.AllForSyllabi"
Deleted:
<
<		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).
 \ No newline at end of file
Added:
>
>		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).
 \ No newline at end of file

Revision 12021-07-14 - cathybareiss

Line: 1 to 1
Added:
>
>
META TOPICPARENT name="CenterForComputing.AllForSyllabi"
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).
View topic | History: r2 < r1 | More topic actions...
 
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2026 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback