CSE 460 taught by Sandeep S Kulkarni (Course & Instructor) - Grade Details
(with breakdown by semester)
Course Title: Computability and Formal Language Theory
Course Description: Formal models of computation such as finite state automata, pushdown automata and Turing machines. Formal definitions of languages, problems, and language classes including recursive, recursively enumerable, regular, and context free languages. The relationships among various models of computation, language classes, and problems. Church's thesis and the limits of computability. Proofs of program properties including correctness.
CSE 460 / Sandeep S Kulkarni - All Semesters
Average Grade - 2.875
Median Grade - 3.5
Latest grades from Fall 2015
CSE 460 / Sandeep S Kulkarni - Overview
Semester | Grade Info | Number of Students |
---|---|---|
Fall 2013 | Average Grade - 3.000 Median Grade - 4.0 |
16 |
Fall 2015 | Average Grade - 2.804 Median Grade - 3.5 |
28 |
Back to Overview for CSE 460 / Sandeep S Kulkarni
Fall 2015
Average Grade - 2.804
Median Grade - 3.5
Back to Overview for CSE 460 / Sandeep S Kulkarni
Fall 2013
Average Grade - 3.000
Median Grade - 4.0