CS 150 - DISCRETE STRUCTURE

    Recent Professors
    Kyu Lee, Roy Osawa
    Recent Semesters
    Spring 2027, Fall 2026
    Class Size
    35 students
    Difficulty
    6.0Demandingout of 10
    Credits
    4
    Prerequisite
    Completion of CS 130 or CS 131 or CS 132. This course covers the fundamental mathematical elements of computer science including mathematical functions, relations and sets; basic logic; proof techniques; basics of counting; graphs and trees; and discrete probability. (CSU, UC, AVC) (Formerly CIS 121)
    Spring 2027 Sections
    View Spring 2027 sections of CS 150
    Transfers To
    CSUCSU GE Area B4
    Description
    This course covers the fundamental mathematical elements of computer science including mathematical functions, relations and sets; basic logic; proof techniques; basics of counting; graphs and trees; and discrete probability.
    Usually Held
    Tue Thu 12:30pm–2:35pm, Tue Thu 2:45pm–4:50pm