Midterm Examination |
CSE 415: Introduction to Artificial Intelligence The University of Washington, Seattle, Autumn 2017 |
Date: Wednesday, October 25, 2017 |
Format: Several short-answer questions, with a few longer-answer questions possible. |
Topics:
Turing test Python Lists slices concatenation copying list comprehensions Functions def default values of arguments lambda local and global variables recursive functions Dictionaries ISA hierarchies Binary relations and the partial-order properties: Reflexiveness, Antisymmetry, Transitivity. Inferrable conclusions, Detecting redundancy Also, symmetry. Inheritable properties vs non-inheritable State Space search State Operator Partial function Precondition Move Goal state State space Branching factor Combinatorial explosion Counting distinct states of simple problems Tower of Hanoi Tic-Tac-Toe Missionaries and Cannibals Problem formulation Path Depth-First Search Breadth-First Search Uniform-Cost Search Best-First Search A* Search heuristic function admissibility of a heuristic Iterative Deepening Depth-First Search Genetic search Simulated annealing Case-based reasoning |