CSE 401, Wi08: Final Exam Review

CSE Home

About Us

Search

Contact Info

The final exam is Wednesday March 19th, 2:30-4:30pm in our regular classroom.

• The final exam will be closed book, closed notes.
• The exam will cover the entire course, although an emphasis will be placed on material covered since the midterm.
• I dug up two old exams which I hesitate to post. These are quite old and do not necessarily represent the same material coverage. The compiler project was for a different language at that time as well. Nevertheless, these may help your brain think a bit about the material. We do not have solutions but we will be happy to chat about any of the questions in office hours. final from au98, final from sp98
• Questions related to our project are also fair game.

All topics from the beginning of the course up to the last week of class are fair game. We may have a couple of extra credit questions on material covered the last week of class. The following is a list of the main topics we've covered since the midterm. Please refer to the midterm review page for topics covered before the midterm.

IV.  Semantic Analysis (not listed on Midterm topics page)

• Scoping
  • Static
  • Dynamic

V.  Intermediate Code Generation

• Intermediate Representations
  • 3 Categories and examples
  • Symbol Table Design

• Runtime Storage Layout
  • Representation of scalars, arrays, objects
  • Memory areas: static, stack, heap

• Calling Conventions
  • Caller vs. Callee
  • What things must be taken care of on call and return
  • Layout of stack frame

• Parameter Passing Modes
  • Call-by-value
  • Call-by-reference
  • Call-by-name

• Object Representation
  • Data Layout
  • Inheritance
  • Method invocation with inheritance (vtables)

• Code Generation for other Language Constructs
  • if-then-else
  • Loops
  • Arrays - new, length, assignment, access

VI.  Target Code Generation

• Register Allocation
• Stack Frame Layout
• Instruction Selection

VII.  Interpreters

• Compilers vs. Interpreters
• Pros and Cons
• Implementation Needs

VIII.  Optimization

• Scopes of Optimization: peephole, local, global, interprocedural
• Examples of each

IX.  Runtime Systems

• What functions can be handled by runtime systems
• Garbage Collection: Reference Counting, Mark/Sweep, Copying, Generational

	Computer Science & Engineering University of Washington Box 352350 Seattle, WA  98195-2350 (206) 543-1695 voice, (206) 543-2969 FAX [comments to rea at cs.washington.edu]