This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CPSC 313 — Fall 2004 Midterm Review Midterm Questions The following sections indicate the types of questions you can expect on the midterm exam. The lab exercises and quizzes are also good practice material. The exam will contain both multiple choice and open ended questions. For the multiple choice questions, read all choices and choose the best one. For open ended questions, if you do not know the answer, explain the steps that you would need to take to arrive at the answer and fill in as much detail as possible. There will be part marks available if you can demonstrate that you know how to answer the question even if you are not able to come up with the answer itself. Terminology Give a brief explanation, in English, for each of the following terms. 1. Decision Problem 2. Language 3. Alphabet 4. Deterministic Finite Automata 5. Nondeterministic Finite Automata 6. epsilon Nondeterministic Finite Automata 7. Language of a finite automata 8. Transition function 9. Extended transition function 10. Transition diagram 11. Transition table 12. Regular Expression 13. Language of a regular expression 14. Regular Language 1 15. Context-Free grammar 16. Push-down Automata 17. Context-Free Language 18. Parse Tree 19. Derivation 20. Recursive Inference 21. Language of a context-free grammar 22. Ambiguous Context-free Grammar 23. Inherently Ambiguous Context-Free Language 24. Chomsky Normal Form24....
View Full Document
This note was uploaded on 10/19/2008 for the course CPSC 313 taught by Professor Na during the Spring '08 term at University of Calgary.
- Spring '08