2011 Set4

1. a) Are there agent functions that cannot be implemented by any agent program?
   b) For mathematician’s theorem proving assistant and internet book shopping agent
      develop a PEAS description of task environment. [8+8]
2. a) Explain in detail about A* search technique.
   b) What are the advantages of heuristic search? In what kind of a problem space would
        a depth first search be better than a breadth first one? [8+8]
3. a) Describe in detail about hill climbing algorithm.
    b) Write a detailed note on genetical algorithms. [8+8]
4. a) Define Pruning? Explain alpha beta pruning in detail.
    b) Discuss how well the standard approach to game playing would apply to games such
        as tennis, pool and croquet which take place in a continuous physical state space. [8+8]
5. a) Define semantics for propositional logic and construct a knowledge base for pits for
        Wumpus world problem.
b) Explain in detail about truth-table enumeration algorithm for deciding propositional
   entailment. [8+8]
6. a) Represent the following sentences in first-order logic using a consistent vocabulary
       (which you must define)
       i) Some students took French in spring 2009.
      ii) Every student who takes French passes it.
     iii) Only one student took Greek in spring 2009.
    iv) The best score in Greek is always higher than the best score in French.
 b) What is atomic sentence and complex sentences? Explain about Quantifiers in detail
    with examples. [8+8]
7. a) Describe about heuristics for state space search.
    b) Describe about language of planning problems in detail. [8+8]
8. a) Explain in detail about induction learning.
    b) Explain in detail about EM algorithm. [8+8]