samplefinal

samplefinal - CS 154 - Introduction to Automata and...

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

View Full Document Right Arrow Icon
CS 154 - Introduction to Automata and Complexity Theory Autumn Quarter, 2009-2010 SAMPLE FINAL Note: This final was from CS154 in the Autumn quarter of 2008-9. In retrospect, it was unusually difficult, so we intend to make the upcoming final a little less challenging. However, there was new material in CS154 this quarter that wasn’t covered last quarter, so some of that will be on the upcoming final although it does not appear here. Look at the questions on the last homework for an idea of what might appear. Instructions: Answer all 6 questions in the space provided. You have a total time of 3 hours and the maximum possible score is 150. The point allocation is roughly proportional to the time required to solve a problem, i.e., 1 point for each minute, with a half-hour left over to reduce time pressure. We strongly recommend that you use a few minutes to go over the exam and plan your strategy. It is important that you be brief in your answers and ensure that it fits in the space provided. You will lose points for a complicated solution, even if it is correct. This exam is an open-book and open-notes exam, i.e., you are allowed to con- sult both the text-book, your class notes and homeworks, and any of the handouts from us. You are not permitted to refer to any other material during the exam
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 01/12/2010 for the course CS 154 at Stanford.

Page1 / 7

samplefinal - CS 154 - Introduction to Automata and...

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