CS 131 - Discrete Structures for Computer Science

    Recent Professors
    Debsankar Mukhopadhyay
    Recent Semesters
    Fall 2026
    Class Size
    Not published
    Difficulty
    4.7Moderateout of 10
    Credits
    3
    Prerequisite
    CS 101 with a grade of C or better.
    Fall 2026 Sections
    View Fall 2026 sections of CS 131
    Transfers To
    CSU
    Description
    This course is an introduction to the discrete structures used in Computer Science with an emphasis on their applications. Topics covered include: Number Systems & Systems for Basics of Counting; Regular Expressions; Functions, Relations and Sets; Combinational Circuits & Digital Logic; Basic Formal Logic; Proof Techniques; Basics of Counting; Recursive Programming & Algorithms; Graphs and Trees; Discrete Probability and Finite State Automata. This course is compliant with the standards of the Association for Computing Machinery (ACM).