C+IN SC 2166 - Mathematical Concepts in Computing II

Institution:

Temple University

Subject:

Description:

A continuation of C+IN SC 1166 (0066). 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: (1) Duplicate Course: No credit for students who have completed Math 3098 (W205). (2) May not be taken for mathematics credit. (3) For Computer Science Majors.

Credits:

4.00

Credit Hours:

Prerequisites:

Grade of C or better in MATH 1041 (C085), and C+IN SC 1166 (0066) or MATH 2196 (W141)

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

WWW.TEMPLE.EDU

Phone Number:

(215) 204-7000

Regional Accreditation:

Middle States Association of Colleges and Schools

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.