This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 22-Oct-09 Name_________________________________Instructions:Write your name on this page. This is a closed book, closed notes exam. You may not use electronic devices. Answer all the questions. If you have a problem understanding a question, write a note pointing out how you interpreted the question, and then answer the question according to your interpretation. Show your work when tracing code segments. You have 75 minutes to complete the exam. Note that PLthroughout will mean Programming Language. Part I Part II Part III Part IV Part V Part VI Part VII Maximum Points 361018 10 6 10 10 Points EarnedTotal: CS 320 Midterm Exam 1 Instructor: P. Kraft Fall 2009 Page 2 Midterm Exam 1 Part I: True or FalseFor each question, circle either TRUEor FALSE. TRUE FALSE 1. Increased capacity to express ideas, better background for choosing appropriate languages, increased ability to learn new languages, and better understanding of implementation issues are all reasons for studying PLs. TRUE FALSE 2. Orthogonality in a PLmeans that a small set of primitive constructs can be combined in a small number of ways to build control & data structures. TRUE FALSE 3. Aliasing is having only one distinct name to access a memory cell. TRUE FALSE 4. Language design has been profoundly affected by the von Neumann computer architecture. TRUE FALSE 5. The semanticsof a PLis the form of its expressions, statements and program units.TRUE FALSE 6. If more than one distinct parse tree can be produced from a grammar it is said to be unambiguous. TRUE FALSE 7. A lexical analyzer is essentially a pattern matcher. TRUE FALSE 8. Keywords cannot be used as names. TRUE FALSE 9. Attributes of variables include type, name, value and address. TRUE FALSE 10. FORTRAN provides a mechanism to associate a variable with a type through default conventions....
View Full Document
- Fall '10
- parse tree, character string types