CS 2120

Discrete Mathematics and Theory 1

New Add to Schedule

Course Description

Introduces discrete mathematics and proof techniques involving first order predicate logic and induction. Application areas include sets, tuples, functions, relations, and combinatorial problems. Prereq: Must have completed CS 1110 or CS 1111 or CS 1112 or CS 1113 with a grade of C- or better OR successfully completed the CS 1110 or CS 2100 place out test.


  • Aidan San

     Rating

    2.22

     Difficulty

    3.83

     GPA

     Sections

    1

    Last Taught

    Spring 2026

  • Sarah Elder

     Rating

     Difficulty

     GPA

     Sections

    2

    Last Taught

    Spring 2026

  • Kevin Sullivan

     Rating

    2.85

     Difficulty

    2.67

     GPA

    3.63

     Sections

    Last Taught

    Fall 2025

  • To Announced

     Rating

     Difficulty

     GPA

     Sections

    Last Taught

    Fall 2025

  • Rohan Chandra

     Rating

     Difficulty

     GPA

    2.95

     Sections

    Last Taught

    Fall 2025

  • Shivani Datar

     Rating

     Difficulty

     GPA

     Sections

    Last Taught

    Spring 2025

  • Elizabeth Orrico

     Rating

    3.28

     Difficulty

    2.88

     GPA

    3.45

     Sections

    Last Taught

    Fall 2024

  • Nathan Brunelle

     Rating

    4.56

     Difficulty

    2.17

     GPA

    3.70

     Sections

    Last Taught

    Fall 2022

  • Briana Morrison

     Rating

    3.17

     Difficulty

    1.50

     GPA

    3.44

     Sections

    Last Taught

    Spring 2022