exam10 - CSE 200 Final Exam Due Wed. June 9 at 1 AM (OK, I...

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

View Full Document Right Arrow Icon
CSE 200 Final Exam Due Wed. June 9 at 1 AM (OK, I won’t actually check until I get in in the morning. But all exams must be turned in before I arrive in my o±ce.) Answer four out of ²ve questions with an informal, but complete, proof. You may not discuss this exam with anyone except myself and William, whether taking the course or not. Each question has equal weight, but some are more di±cult than others. You may cite without proof any result from the Arora- Barak or Sipser text or proved in class. In particular, you can use without proof the NP -completeness of any problem proved NP -complete in class, in the two texts, or on the homeworks, including: SAT, 3-SAT, Independent Set, Clique, Vertex Covering, 3-coloring, Hamiltonian Circuit, and Subset Sum. However, you may not use the list of NP -complete problems in the appendix of Garey and Johnson without proof. Computability Give an example of a language that is not decideable even with an oracle for the Halting Problem, i.e., that is not Turing reducible
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.

Page1 / 2

exam10 - CSE 200 Final Exam Due Wed. June 9 at 1 AM (OK, I...

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