Computer Science 164 - Fall 1999 - Rowe - Midterm 1

Computer Science 164 - Fall 1999 - Rowe - Midterm 1 - CS...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 164, Midterm 1, FALL 1999 CS 164: Fall 1999 Midterm Solutions Professor L. Rowe PROBLEM 1. Answer the following TRUE/FALSE questions: All non-deterministic finite state automatons can be converted to a deterministic finite state automaton: TRUE An object-oriented program is easier to read and understand than a conventional procedural program: TRUE The class of the value assigned to the this variable in a method is the class within which the method is declared: FALSE A Java method signature does not include the return type: TRUE A transient instance variable in Java is not written to persistent storage if the object is output: TRUE The class of the Class object is Class : TRUE A regular expression can specify the set a n b n where 0<n<5, that is {ab, aabb, . .., aaaabbbb}: TRUE A shift reduce parser performs reductions in the reverse order specified by a left-most derivation: FALSE The string aabb is a sentential form for the grammar S->ab | aSb: TRUE A JO99 variable has an l-value and r-value: TRUE
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 4

Computer Science 164 - Fall 1999 - Rowe - Midterm 1 - CS...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online