CS 241 - DISCRETE STRUCTURES

    Recent Professors
    Anita Rathi, Tafadzwa Dube, Ignatios Vakalis
    Recent Semesters
    Spring 2027, Fall 2026, Spring 2026, Fall 2025
    Class Size
    30 students
    Difficulty
    6.7Demandingout of 10
    Credits
    3
    Prerequisite
    Prerequisites: MATH 231 or MATH 229 and MATH 242 or High School equivalent
    Spring 2027 Sections
    View Spring 2027 sections of CS 241
    Transfers To
    UC and CSUCal-GETC Area 2 · IGETC Area 2A · CSU GE Area B4 · UCTCA Area 2A · UCTCA Area UC-M · UCTCA Area UCTCA · UCTCA Area 2
    Description
    Develops and analyzes structures of computer science: numbers, sets, relations, functions and trees. This course includes propositional and predicate logic, applications of predicate logic: preconditions, postconditions, invariants, guards; inductive proofs; applications to verification of algorithms; introduction to complexity of algorithms.
    Usually Held
    Tue Thu 12:30pm–1:50pm, Mon Wed 1:30pm–2:55pm, Mon Wed Fri 11:15am–12:20pm