See instructions.html.
A practice-exam and solution is available on D2L » Content » exam02.
(The practice-exam's solution is released a bit later than the practice-exam,
to help encourage a practice-take
before looking at the solution).
Our exam might include...
Given a grammar, be able to design structs to represent parse trees for it
(you'll have a choice of racket or Java).
write a recursive-descent parser for that grammar (returning the parse tree).
Be able to write functions which process that parse-tree,
including functions that selectively stop processing sub-trees based on some criterion.
Questions based on bits of code from the Y0–Y4 implementations, possibly modifying that code.
Understanding static scope (let,let*), shadowing,
and function-closures.
prolog questions, including list-based processing.
questions very-similar to #1,#2 from this exam02-practice.
Questions the same-or-similar-to any question on exam01 are certainly fair game.
exam01
see D2L (now includes sol'n).
It also now includes exam01-redemption
and due Apr-08 (Thu) 14:00.
It will be accessible after you complete the pre-req of watching the
short video going over common-missteps on the exam.