Midterm Examination 1
CSE 415: Introduction to Artificial Intelligence
The University of Washington, Seattle, Autumn 2011
Date: Monday, November 14
Format: Multiple choice. Bring a standard answer sheet ( "scantron" form) available for purchase at the U-Bookstore and other places.
Topics:
Turing test

Python
  Lists and Strings:
    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:
    Reflexive, Symmetry, Transitive
  Inferrable conclusions, Detecting redundancy

State Space search
  State
  Operator
    Move
    Partial function  
    Precondition
  Goal state
  Path
  Depth-First Search
  Breadth-First Search
  Uniform-Cost Search
  Best-First Search
  A* Search
    heuristic function
    admissibility of A*
  Iterative Deepening Depth-First Search
  Two-Person, Zero-sum games
    minimax search
    alpha-beta pruning
    static evaluation functions
      Tic-tac-toe
      Checkers
    Zobrist hashing
  Genetic search
  Simulated annealing
  Case-based reasoning

Logic
  Propositional Calculus
    Well-formed formula
    Truth value
    Satisfiability (Consistency)
    Tautology (Validity)
    Contradiction (Inconsistency)
    Syllogism
    Perfect induction
    Modus ponens
    Proof by contradiction
    Resolution
      Literal
      Clause
        Obtaining clause form
          DeMorgan's laws
          Distributive laws
      Complementary pair
      Parent clauses
      Resolvent
  Predicate Calculus
    Well-formed formula
      terms
      quantified formulas
    Truth value
    Formal interpretation
      domain
      assignments for constants,
        function symbols and predicate symbols
    Models of sets of formulas
    Substitution instances
    Unification
    Resolution
      Literal
      Clause
      Resolvent