CS 3120

Discrete Mathematics and Theory 2

New Add to Schedule

Course Description

The goal of this course is to understand the fundamental limits on what can be efficiently computed. These limits reveal properties about information, communication, and computing, as well as practical issues about how to solve problems. Introduces computation theory including grammars, automata, and Turing machines. Prereq: CS 3100 with a grade of C- or better


  • Raymond Pettit

     Rating

     Difficulty

     GPA

     Sections

    1

    Last Taught

    Spring 2026

  • Wei-Kai Lin

     Rating

    2.33

     Difficulty

    4.00

     GPA

     Sections

    1

    Last Taught

    Spring 2026

  • Mark Floryan

     Rating

    3.19

     Difficulty

    4.21

     GPA

    3.08

     Sections

    Last Taught

    Fall 2025

  • Faculty Staff

     Rating

     Difficulty

     GPA

     Sections

    Last Taught

    Summer 2025

  • David Evans

     Rating

     Difficulty

     GPA

    3.83

     Sections

    Last Taught

    Spring 2023

  • Mohammad Mahmoody

     Rating

     Difficulty

     GPA

     Sections

    Last Taught

    Spring 2023

  • Nathan Brunelle

     Rating

     Difficulty

     GPA

     Sections

    Last Taught

    Fall 2022