This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CPSC 313 — Midterm Test November 7, 2005 Name: Tutorial Section Day (Circle One): Mon Tues Wed Instructions: Answer all multiple choice questions in part A on the score card using pencil . Answer all questions in part B in the space provided. The only aid allowed is one index card with notes. In part B you are required to answer questions 1, 2 and 3. In part B you have the choice between answering question 4 or 5. If you answer both question 4 and 5 only question 4 will be marked. There are 45 points available on this exam. Duration: 50 minutes ID Number: Section Question Score Possible score A 115 15 B 1 5 2 5 3 10 4 or 5 10 Total: 45 1 ID Number: Part A  Multiple Choice Questions Answer all multiple choice questions on the score card using pencil . Each question is worth 1 mark. True/False Questions Answer true or false for the following statements. On the bubble sheet, indicate ’true’ by filling in the bubble for ’a’ and ’false’ by filling the bubble for ’b’. 1. There exists an unambiguous contextfree grammar for all contextfree languages. 2. If a language is regular, it must also be contextfree. 3. If a language L is regular, then its complement L is also regular. 4. The pumping lemma for regular languages is useful for proving that a language is not regular. 5. A decision problem is a problem where the input is a sequence of strings, s 1 , s 2 , . . . , s n , and the output is one of these strings s i (1 ≤ i ≤ n .) 6. The set of languages accepted by NFAs is the same as the set of lan guages accepted by DFAs. 2 ID Number: Multiple Choices For the following questions choose the best answer....
View
Full Document
 Spring '08
 NA
 Formal language, Formal languages, Formal grammar, Contextfree grammar, ID NUMBER

Click to edit the document details