Exams


Final Exam

·  When: Monday, December 12 3:30pm-5:30pm

·  Where: ME 1061

·  The exam is open book and open notes.

·  Topics: Cumulative and comprehensive, covering all material taught in the course.

-          Focus on topics covered by Problem Sets. (Questions and Solutions)

-          ~20% on topics covered by Midterm 1, PSet 1&2.

-          ~20% on topics covered by Midterm 2, PSet 3&4 (focus on instruction scheduling and short answer questions).

-          ~60% on topics covered by PSet 5.

 

·  There will be review sessions on Wednesday, December 7 and Friday, December 9.

 

·  The exam will follow the “I DON’T KNOW” rule: if you do not know the answer to a problem, you can simply write “I DON’T KNOW” and you will get 20% of the credit for that problem (for knowing you do not know the answer and saving us time for reading junk). The number of points you get in this manner cannot exceed 10 points across the whole exam.


Midterm 2

·  When: Wednesday, November 2 8:00pm-9:15pm

·  Where: FRNY G140

·  The exam is open book and open notes.

·  Topics: All topics covered in Lecture #4-7 and Lecture #9. Global register allocation (Lecture #8) will not be covered.

-          Focus on topics covered by PSet 3 and PSet 4. (Questions and Solutions)

-          There will be some short answer questions about concepts of optimizations, such as register allocation, common subexpression elimination, and instruction scheduling.

-          There will be *no* questions on dataflow analysis.

 

·  There will be a review session on Monday, October 31.

 

·  The exam will follow the “I DON’T KNOW” rule: if you do not know the answer to a problem, you can simply write “I DON’T KNOW” and you will get 20% of the credit for that problem (for knowing you do not know the answer and saving us time for reading junk). The number of points you get in this manner cannot exceed 10 points across the whole exam.


Midterm 1

·  When: Thursday, September 29 8:00pm-9:15pm

·  Where: FRNY G140

·  The exam is open book and open notes.

·  Topics: All topics covered from Lecture #1 to Lecture #3.

-          Focus on topics covered by PSet 1 and PSet 2. (Questions and Solutions)

-          There will be some multiple-choice questions about concepts of compilers, such as

o   Types of a compiler (difference between standard compiler and JIT compiler, etc.)

o   Phases of a compiler (front-end and back-end, scanner, parser, code generator, etc.)

-          There will be *no* questions on semantic routines.

 

·  Some snapshots from the review session on Sep 28 can be helpful for your preparation.

 

·  The exam will follow the “I DON’T KNOW” rule: if you do not know the answer to a problem, you can simply write “I DON’T KNOW” and you will get 20% of the credit for that problem (for knowing you do not know the answer and saving us time for reading junk). The number of points you get in this manner cannot exceed 10 points across the whole exam.