CSE 341: Quizzes and Exams, Autumn 2002

• Quiz 1 covers Scheme, including list structure, writing recursive procedures, scope and extent of bindings. Also, pure functions, referential transparency and side effects.
• Quiz 2 is scheduled for Thursday, November 21 in sections. Take the quiz in the section for which you are officially registered. Bring a standard answer sheet ("Scantron form") and some pre-sharpened number 2 pencils.
  Topics include closures in Scheme, ML bindings, ML's type system and type inference, including polymorphism, formal syntax as described with Backus-Naur Form, parsing and derivations, the sample grammar for arithmetic expressions discussed in class, Functional programming techniques such as currying, and composition, lazy evaluation vs eager evaluation, object-oriented programming and certain Java constructs. (But click on the Quiz 2 link for more details.)
• The final examination will be inclusive of all language and conceptual material covered during the course. Many of the questions will be similar to questions on Quiz 1 and Quiz 2. Some additional information with selected example programs can be found here