Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

CS 215 Open-book Final Examination: Problems in Computer Science, Exams of Computer Science

The final examination questions for a university-level computer science course, cs 215. The questions cover topics such as regular languages, pda, turing machines, vertex cover, and p vs npspace. Students are required to answer the first six questions within a total of 60 points, and the seventh question is optional for bonus points.

Typology: Exams

2009/2010

Uploaded on 03/28/2010

koofers-user-abk
koofers-user-abk 🇺🇸

10 documents

1 / 8

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CS 215 (Open-book) Final Examination
Name:
SSN:
SPECIAL INSTRUCTIONS:
This is an open book exam, but you may only consult the textbook
and lecture notes during the exam.
You must answer the first 6 questions with 60 points in total.
The 7th question is optional.
You may use any results given in class or the text book
without providing a definition or proof.
All constructions can be described informally.
-----------------------------------------------------------------
Question Score
1
2
3
4
5
6
7
Total
------------------------------------------------------------------
1
pf3
pf4
pf5
pf8

Partial preview of the text

Download CS 215 Open-book Final Examination: Problems in Computer Science and more Exams Computer Science in PDF only on Docsity!

CS 215 (Open-book) Final Examination

Name: SSN:

SPECIAL INSTRUCTIONS:

This is an open book exam, but you may only consult the textbook and lecture notes during the exam. You must answer the first 6 questions with 60 points in total. The 7th question is optional. You may use any results given in class or the text book without providing a definition or proof. All constructions can be described informally.

Question Score

Total

QUESTION 1. [10 pts] Given a language

, let

In other words,

contains all words obtained from each word in

by dividing it into two (possibly empty) pieces and exchanging these pieces. (The exchange can also be thought of as a rotation operation.)

Prove that if

is regular, so is

QUESTION 3. [10 pts] Prove that it is undecidable whether a TM loops on an infinite number of distinct input strings.

QUESTION 4. [10 pts] Prove that the following variant of Vertex Cover (VC) is NP-complete: SQRT-VC

has a vertex cover of size at most -

QUESTION 6. [10 pts] We know that NP Q NPSPACE = PSPACE. Prove that if any

NP-complete language is also PSPACE-complete, then NP = PSPACE.

Optional QUESTION 7. [10 bonus pts] We claimed in class that optimization problems and decision prob- lems are equivalent as far as polynomial-time solvability is concerned. Suppose that the language HAMPATH is in P. Show how to find a Hamilton path in graph

from vertex R to vertex S, for any

given instance

R

S