Skip to contentSkip to main navigationSkip to local navigation

CIS 262 Discrete Mathematics for Computer Science

Find Courses

Search by Keyword

Browse Courses by Subject Code

Course Description

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.

Units: 3
Degree Credit
Letter Grade Only
  • 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.
Corequisites: None
Transfer Credit: CSU , UC
C-ID: COMP 152