University of Toronto - Fall 2011
Department of Computer Science
CSC 384: Introduction to Artificial Intelligence
Example Tests
Midterm
The midterm will cover the following areas:
general stuff about intelligence, artificial intelligence, agents (from the introductory lecture)
everything on search including: Uninformed Search, Heuristic Search, Gametree Search, Backtracking Search
the first half of the slides on KR: first-order-logic (syntax and semantics), interpretations, models
The emphasis will be on Search.
The following contain questions similar to those that will be on the midterm:
Midterm Sample Questions 1
Midterm Sample Questions 2
Midterm Sample Questions 3
Final
The final exam will cover all material of the course, including material covered in the assignments or tutorials.
There will be both understanding questions and question where you are asked to apply some techniques learned in class (or in the assignments).
The following aids are allowed:
Non-programmable calculator (may be helpful for questions on Bayesian networks)
A handwritten aid sheet no larger than Letter size (11" by 8.5"). You may use both sides. No computer printed aid sheet is acceptable. You may want to write down the steps necessary to convert first order sentences into clausal form.
No other aids allowed, in particular no cellphone, textbook, etc. (see also the offical UofT exam page)
What is NOT expected from you on the exam:
writing PROLOG code
Graph Plan Algorithm (however, questions regarding the Reachability Graph and the Level Graph may be on the exam)
ADL (last few slides of Planning)
Writing operators in the PDDL notation, though you must be able to read them and be able to read & write STRIPS operations/actions.
Decision Networks
Exams from previous years that are similar to the exam in terms of structure and the style of questions:
Final Exam Winter 2011
Final Exam Fall 2010 (disregard Question 6)
Final Exam Winter 2010
Final Exam Fall 2008 (disregard Question 7)