CSE 415 Midterm Exam Topics
CSE 415: Introduction to Artificial Intelligence
The University of Washington, Seattle, Winter 2008
The following is a detailed list of topics that the midterm exam may cover. The actual questions will cover some subset of these topics.
Turing test

Python
  Lists and Strings:
    slices
    concatenation
    copying

  Functions
    def
    default values of arguments
    lambda
    callable objects

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

Image understanding
  Human vision: subjective contour illusion, pareidolia
  Shannon sampling
  Quantization
  Histograms
  Thresholding
  Valley method for threshold selection
  Hough transform
    polar coordinates representation of lines
    parameter space array
    voting process
    peak detection
  Morphology transformations
    erosion
    dilation
    opening
    closing

Logical reasoning
  Propositional Calculus
    well-formed formula
    truth value
    satisfiability (consistency)
    tautology (validity)
    contradiction (inconsistency)
    perfect induction
    modus ponens
    resolution
      literal
      clause
        obtaining clause form
          Demorgan's laws
          distributive laws
          skolem constant, skolem function
      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

    unification
      elementary substitutions
      substitutions
      unifiers
      most general unifiers

    Horn clauses
      definition
      Edinburgh syntax
      logic programs

    interpretation for a set of formulas
      domain
      assignments for constant symbols
      mappings for function symbols
      mappings for predicate symbols
      models
The sample questions used in the review session are available here.
For answers, see the key.