# Difference between revisions of "Theory of Computation"

(→Exam review) |
(→Final Exam, Spring 2019) |
||

Line 27: | Line 27: | ||

==Final Exam, Spring 2019== | ==Final Exam, Spring 2019== | ||

* [http://cs.indstate.edu/~jkinne/cs420-s2019/code/exam3_sample/exam3_sample.txt sample exam] | * [http://cs.indstate.edu/~jkinne/cs420-s2019/code/exam3_sample/exam3_sample.txt sample exam] | ||

− | * [http://cs.indstate.edu/~jkinne/.video/exam3_sample_dfa_I.2.webm DFA | + | * [http://cs.indstate.edu/~jkinne/cs420-s2019/code/exam3_sample/exam3_sample_solutions.docx sample exam solutions] |

+ | * [http://cs.indstate.edu/~jkinne/.video/exam3_sample_cf_I1.webm CFL language I.1] | ||

+ | * [http://cs.indstate.edu/~jkinne/.video/exam3_sample_dfa_I.2.webm DFA language I.2] | ||

+ | * [http://cs.indstate.edu/~jkinne/.video/exam3_sample_p_I3.webm P language I.3] | ||

+ | * [http://cs.indstate.edu/~jkinne/.video/exam3_sample_np_I4.webm NP language I.4] | ||

+ | * [http://cs.indstate.edu/~jkinne/.video/exam3_sample_decidable_I5.webm Decidable language I.5] | ||

+ | * [http://cs.indstate.edu/~jkinne/.video/exam3_sample_undecidable_I6.webm Undecidable language I.6] |

## Revision as of 15:01, 7 May 2019

## Contents

# Exam review

## Regular Expressions Exam, Spring 2019

Sample exam - exam1_practice.txt

First exam

- exam1.docx
- exam1-solutions.docx
- Video solutions
- Note - these videos play in the browser on some browsers (e.g., Chrome) and are downloaded by default on others (e.g., Safari)
- DFA question 1a
- Pumping Lemma question 1b
- DFA question 1c
- Pumping Lemma question 1d
- Python3 regular expressions question 2
- Proof by contradiction question 3a
- Proof by induction question 3b
- Contrapositive question 3c
- DFA transition table question 4
- What is the language question 5
- Intersection of regular languages question 6

## Context Free Languages Exam, Spring 2019

Sample exam - exam2_practice.txt Sample exam solutions - exam2_practice_solutions.docx