Midterm Examination 1
CSE 415: Introduction to Artificial Intelligence
The University of Washington, Seattle, Autumn 2009
Date: Monday, November 16
Format: Part I: Multiple choice. Bring a standard answer sheet ( "scantron" form) available for purchase at the HUB branch of the U-Bookstore and other places. Part II: Written answer.
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

Logical reasoning
  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
      variables, constants, and functions
      terms
      atomic formulas
      compound formulas
      quantifiers
      quantified formulas

      literals

    Representing situations with Pred. Calc. formulas
      identifying a domain
      structuring the domain
      identifying key relations
      functions vs predicates for expressing relationships
      creating constants
      expressing quantification

    Formal logical interpretations
      domains
      assignment of constant symbols to domain elements
      specification of functions and predicates
    Formal logical models and their relationship to satisfiability,
      tautologies, and satisfiable non-tautologies

Probabilistic reasoning
  Bayes' rule
  Odds and conversion between odds and probability
  Odds formulation of Bayes' rule
  Necessity and sufficiency factors lambda and lambda prime
Some Sample questions are available.