CISC 2210 Introduction to Discrete Structures
(Prior to Fall 2010, this course was known as CIS 11.
The information below might still reflect the old course numbers. Bracketed numbers, if any, are the old course numbers. Learn more...)
3 hours; 3 credits
Elementary set theory, functions, relations, and Boolean algebra. Switching circuits, gating networks. Definition and analysis of algorithms. Applications of graph theory to computer science. Related algorithms. Introduction to combinatorial computing and counting arguments. Introduction to error analysis.
Prerequisite: Computer and Information Science 1.10, or 1.20, or 1110 [1.5], or 1115, or both of 1113 and 1114, or 1170, or 1180, or 1215; and Mathematics 1011 [2.9], or 1012, or 2.92, or assignment to Mathematics 3.20, 1201 [3.3], or 4.10 by the Department of Mathematics.
DISCLAIMER
