CS/IS 125 - DISCRETE STRUCTURES FOR COMPUTING

    Recent Professors
    Not yet assigned
    Recent Semesters
    No scheduled sections on record
    Class Size
    Not published
    Difficulty
    4.6Moderateout of 10
    Credits
    4
    Prerequisite
    CS/IS135 or equivalent
    Transfers To
    UC and CSUCal-GETC Area 2
    Description
    CS/IS 125 is a course in discrete structures that furnishes a strong foundation of mathematical tools for modeling problems and applications in computer science. Topics include logic operations, combinatorics, undirected and directed graphs, trees, relations and sets, proofs, Boolean algebra, algebraic systems, finite state automata, and discrete probability.