CIS 2166 - Vaporjawn/Temple-University-Computer-Science-Resources GitHub Wiki

CIS 2166. MATHEMATICAL CONCEPTS IN COMPUTING II. 4 CREDIT HOURS. This course is typically offered in Fall and Spring. A continuation of CIS 1166. Concepts include recursion and recursive algorithms; relations including equivalence, congruence, and order; introduction to graphs and trees. Additional topics include Boolean algebra and finite automata. Applications to computer science will be illustrated. NOTE: For Computer Science Majors.

For any CIS prerequisite course taken prior to Spring 2012 a grade of C or better is required.

Repeatability: This course may not be repeated for additional credits.

Pre-requisites: (MATH 1041|Minimum Grade of C|May not be taken concurrently OR MATH 1941|Minimum Grade of C|May not be taken concurrently OR MATH 1038|Minimum Grade of C|May not be taken concurrently OR MATH 1042|Minimum Grade of C-|May be taken concurrently OR MATH 1044|Minimum Grade of C-|May be taken concurrently OR MATH 1942|Minimum Grade of C-|May be taken concurrently OR MATH 1951|Minimum Grade of C-|May be taken concurrently OR MATH 2043 to 3080| Required Courses:1|Minimum Grade of C-|May be taken concurrently OR MA06 Y|May not be taken concurrently OR MATW Y|May not be taken concurrently) AND (CIS 1068|Minimum Grade of C-|May not be taken concurrently OR CIS 1968|Minimum Grade of C-|May not be taken concurrently) AND (CIS 1166|Minimum Grade of C-|May not be taken concurrently OR CIS 1966|Minimum Grade of C-|May not be taken concurrently OR MATH 2111|Minimum Grade of C-|May not be taken concurrently)