CIS 262 - Discrete Mathematics for Computer Science

    Recent Professors
    Bill F. Schwarz
    Recent Semesters
    Spring 2026, Spring 2025
    Class Size
    34 students
    Credits
    3
    Prerequisite
    CIS 250 or CIS 284 and successful completion of Intermediate Algebra or equivalent, or placement by other measures as applicable.
    Spring 2026 Sections
    View Spring 2026 sections of CIS 262
    Transfers To
    UC and CSUCal-GETC Area 2
    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.
    Usually Held
    Tue 12:45pm–2:00pm