This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: University of Virginia - cs3102: Theory of Computation Spring 2010 PS6 Due: 27 April 2010 (2:00pm) This problem set focuses on material from Chapters 7 and classes since Exam 2. You are strongly encouraged to use LaTeX to produce your submission, and we have provided a La- TeX template to assist with this. You may, however, handwrite your answers so long as your writing is legible and easily interpreted . For full credit, answers must be concise, clear, and convincing, not just correct. Collaboration Policy. For this assignment, we will follow the same collaboration and re- source policy as on Problem Sets 1-5. See the Problem Set 1 handout for a full description of the policy. Use collaboration to help you learn, but not in ways that prevent you from learning to solve problems on your own. Problem 1: Asymptotic Notation. The way we advocated using asymptotic notation to de- scribe algorithm complexity in Classes 22 and 23 is different from how Sipser uses it in Sec- tion 7.1. Identify at least two ways in which Sispers use of the asymptotic operators differstion 7....
View Full Document
This document was uploaded on 11/29/2010.
- Fall '09