Return to Previous New Search
Catalog Entries

Temple University

Go to Main Content

 

 

HELP | EXIT

Catalog Entries

 

2015 Fall
Apr 26, 2024
Transparent Image
Legend:
Click on Course Title for Details

= This course has restrictions
= There are pre-requisites to take this course
= This course has co-requisites.
= There are fees to take this course.

Information Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course.

CIS 2166 - Mathematical Concepts in Computing II

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.
Credit Hours: 4.000

Levels: Graduate, Undergraduate
Schedule Types: Lecture and Recitation

Division: Undergraduate
Department: CST:Computer & Info Sci


Return to Previous New Search XML Extract
Transparent Image
Skip to top of page
Release: 8.7.2.4