Homework 5 - Chapters 7 and 8

Due: Wednesday February 27, 2008 at 5pm

Each question is worth 2 points.

  1. Give the order, length and defining length of the schema 1**00*.
  2. According to the Schema Theorem, what characteristics will make it more likely that a schema has more instances in the next generation?
  3. What is an evolutionary strategy and how does it differ from genetic algorithms?
  4. How does genetic programming differ from genetic algorithms?
  5. List the main steps in genetic programming.
  6. Draw the parse tree for the expression (+ (* A B) (- C D)).
  7. Do the crossover operation for the expressions (+ (* A B) (- C D)) and (* A (- B C)).
  8. What is a hybrid intelligent system?
  9. Why is a neural expert system capable of approximate reasoning?
  10. Why are fuzzy expert systems and neural networks complementary?