The final exam will be 5:00-7:00, Monday Dec. 17, in WWH 513. Open book, open notes.
To help focus your study, and to enable me to ask more probing questions than otherwise, I am going to give some fairly detailed information about the final exam. In particular, I am going to specify some particular examples that will be the subject of questions on the exam. If you prepare and understand these examples in advance, the exam should be reasonably straightforward; if you don't, the exam will be almost impossible, because it will be too hard to grasp the examples in the time allotted.
All questions are equally weighted.
Problem 1 will be about the CFG in Problem Set 1, problem 2.
Problem 2 will be about a semantic processor. Details here .
Problem 3 will be about the k-gram model and Viterbi's algorithm. This will be a general question, so there is no specific example to prepare in advance.
Problem 4 will be about the axioms of Solution Set 2, Problem 2.B.
Problem 5 will be about the partially-ordered plans of Solution Set 2, Problem 2.C.
Problem 6 will be about the Markov decision process of Solution Set 3, problem 1.A.
Problem 7 will be about computer vision. This will be a general question, so there is no specific example to prepare in advance.