CIS 262 – Discrete Math. for Comp Scienc (CRN: 44084)

Covers topics in discrete mathematics with emphasis on computer science applications. Includes algorithms, Master’s theorem, base and number representation, logic, sets and category theory, relations, functions, induction, recursion, Boolean algebra and digital circuits, combinatorics, Pascal's Identity, permutations and combinations, counting, probability, Bayes' Theorem, Statistics, algebraic structures, Binomial theorem, directed and undirected graphs, elementary number theory, discrete probability, proof techniques, induction, pigeonhole principle, sequences, Fibonacci numbers and computational complexity.

Lecture hours/semester: 48-54

Homework hours/semester: 96-108

Prerequisites: CIS 250 or CIS 284 and successful completion of Intermediate Algebra or equivalent, or placement by other measures as applicable.

C-ID: COMP 152