CMPSCI 601: Theory of Computation

David Mix Barrington

Spring, 2003

Final Exam Solutions

Posted 2 June 2003

(Exam was 19 May 2003 on-campus, by 28 May 2003 off-campus.)

Answers are in blue.

Directions: Question 1 consists of five statements to be marked "true", "false", or "unknown", with no justification needed. Here "unknown" means "not resolvable by the results in this course". No justification is needed or wanted (though of course I have provided one in these solutions), and there is no penalty for a wrong guess.

Questions 2 and 3 each consist of a true statement that you are to prove. As these statements were proved in lecture, you may not simply quote their proofs -- give an explanation in your own words of why they are true that demonstrates your understanding.

Questions 4 through 8 are similar to those on the midterm. There is a statement which is either true or false. You will get five points for a correct boolean answer, and there is no penalty for guessing. Then JUSTIFY YOUR ANSWER -- the five remaining points will be awarded based on the degree to which your answer is correct and convincing.

Altogether there are eight questions for 100 points.

Last modified 3 June 2003