CS 131 - Discrete Structures for Computer Science

    Recent Professors
    Not yet assigned
    Recent Semesters
    No scheduled sections on record
    Class Size
    Not published
    Credits
    3
    Prerequisite
    CS 101
    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).