Privacy | Terms

theCourseForum
© v1.3.0

CS 3102

Theory of Computation

New Add to Schedule

Course Description

Pre-Requisite(s): (CS 2102 or CS 2120) and (CS 2100 or CS 2110 or CS 2501 topic "DSA 2" or the CS 2110 placement test); both with grades of C- or higher

Introduces computation theory including grammars, finite state machines, pushdown automata, and Turing machines.


  • Nathan Brunelle
     Rating

    3.39

     Difficulty

    3.45

     GPA

    3.64

     Sections

    —

    Last Taught

    Fall 2022

  • Faculty Staff
     Rating

    —

     Difficulty

    —

     GPA

    —

     Sections

    —

    Last Taught

    Spring 2022

  • David Evans
     Rating

    3.00

     Difficulty

    3.00

     GPA

    3.71

     Sections

    —

    Last Taught

    Fall 2021

  • Co-taught Evans
     Rating

    —

     Difficulty

    —

     GPA

    —

     Sections

    —

    Last Taught

    Fall 2019

  • Gabriel Robins
     Rating

    2.83

     Difficulty

    2.89

     GPA

    3.25

     Sections

    —

    Last Taught

    Spring 2018

  • Dimitrios Diochnos
     Rating

    —

     Difficulty

    —

     GPA

    3.50

     Sections

    —

    Last Taught

    Fall 2018

  • Worthy Martin
     Rating

    2.75

     Difficulty

    4.00

     GPA

    2.83

     Sections

    —

    Last Taught

    Fall 2015

  • Abhi Shelat
     Rating

    —

     Difficulty

    —

     GPA

    2.95

     Sections

    —

    Last Taught

    Fall 2010