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 and Information Science and Technology Majors.

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

Levels: Graduate, Undergraduate
Schedule Types: Lecture and Recitation

Division: Undergraduate
Department: CST:Computer & Info Sci

General Requirements:
(  Course or Test: MATH 1041 | Minimum Grade of C | May not be taken concurrently.  )
OR
(  Course or Test: MATH 1941 | Minimum Grade of C | May not be taken concurrently.  )
OR
(  Course or Test: MATH 1042 | Minimum Grade of C- | May be taken concurrently.  )
OR
(  Course or Test: MATH 1942 | Minimum Grade of C- | May be taken concurrently.  )
OR
(  Course or Test: MATH 1951 | Minimum Grade of C- | May be taken concurrently.  )
OR
(  Course or Test: MATH 2043 to 3080 | Required Courses: 1 | Minimum Grade of C- | May be taken concurrently.  )
OR
(  MA06 Y - May not be taken concurrently.  )
AND (  Course or Test: CIS 1166 | Minimum Grade of C- | May not be taken concurrently. )