Computer Science 172 - Fall 1999 - Jordan - Midterm 1

Computer Science 172 - Fall 1999 - Jordan - Midterm 1 - CS...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 172, Midterm, Fall 1999 CS 172, Fall 1999 Midterm Professor M. Jordan 172 students: On this exam, I am more interested in testing your ability in setting up the solution to a variety of problems than necessarily in getting all of the details. I don't expect anyone to answer all of the questions fully and correctly. We will be reasonably generous with partial credit, so it would be better to provide partial answers to many questions than complete answers to a few questions. For the more difficult questions, you might consider first writing down a brief section called "Sketch of answer," and later, if you have time, writing down a more detailed section called "Details." --Mike Problem #1 Closure properties of languages associated with Turing machines. (a) Prove that the union of two Turing-recognizable languages is Turing recognizable. (b) Prove that the union of two decidable languages is decidable. Problem #2
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 05/17/2009 for the course CS 172 taught by Professor Seshia during the Spring '08 term at Berkeley.

Page1 / 2

Computer Science 172 - Fall 1999 - Jordan - Midterm 1 - CS...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online