Scribd Logo
Importer

Bienvenue sur Scribd !

  • AI Exam2012

    Transféré par

    al_badwi
    52 vues2 pages
    This document contains an exam for an Artificial Intelligence class covering various topics: 1. It defines a heuristic function and asks about its role in tic-tac-toe. 2. It asks about the percepts, sensors, operating environment, effectors and goals of a medical diagnosis expert system. 3. It provides predicates and asks logical queries about relationships between people. 4. It compares forward and backward reasoning and defines several AI terms.

    Description originale:

    AI exam test aden

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Formats disponibles

    PDF, TXT ou lisez en ligne sur Scribd

    Avez-vous trouvé ce document utile ?

    Ce contenu est-il inapproprié ?

    Signaler ce document
    This document contains an exam for an Artificial Intelligence class covering various topics: 1. It defines a heuristic function and asks about its role in tic-tac-toe. 2. It asks about the percepts, sensors, operating environment, effectors and goals of a medical diagnosis expert system. 3. It provides predicates and asks logical queries about relationships between people. 4. It compares forward and backward reasoning and defines several AI terms.

    Droits d'auteur :

    Attribution Non-Commercial (BY-NC)
    Téléchargez comme PDF, TXT ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    52 vues2 pages

    AI Exam2012

    Transféré par

    al_badwi
    This document contains an exam for an Artificial Intelligence class covering various topics: 1. It defines a heuristic function and asks about its role in tic-tac-toe. 2. It asks about the percepts, sensors, operating environment, effectors and goals of a medical diagnosis expert system. 3. It provides predicates and asks logical queries about relationships between people. 4. It compares forward and backward reasoning and defines several AI terms.

    Droits d'auteur :

    Attribution Non-Commercial (BY-NC)
    Téléchargez comme PDF, TXT ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    sur 2

    University of Aden Faculty of Engineering Odd Semester Examination (2011-2012) Subject: Artificial Intelligence Date: /4/2012 Class: B5CS/B5CSE

    Time: 2 hours -------------------------------------------------------------------------------------------------------ANSWER ANY FOUR QUESTIONS 1# (a) What is a Heuristic? When it Dominating other function. Describe a good heuristic function for the Tic_Tac_Teo problem. (b) Find out about the Medical Diagnosis Expert system : (i) What are the percepts and sensors for this agent? (ii) Characterize the operating environment. (iii) What are the effectors and the actions agent can take? (iv) What are the main Goals? 2# (a) Suppose you design a machine to pass the Turing test. What are the capabilities such a machine must have? (b) Consider the following statements:

    Using the forward resolution and backward (refutation) reasoning, prove that Dogs are Apartment pets 3# (a) List the Problem's Characteristics and explain any two of them with suitable example. (b) Given the following predicates, knows (X, Y). father (X, Y). Write the following queries with their answers; (i) Is Omer the father of Ali? (ii) Is there a person known by both Ali and Omer? (iii) Who is the son of Salem? (iv) Does Omer know any body? 4# (a) Compare forward and backward reasoning with example (b) Explain what is meant by the following terms: (i) Weak AI, (ii) Completeness, (iii) Admissibility, (iv) Rational agent.

    (i) The dog is small. (ii) Every small pet is an Apartment pet. (iii) Dogs are pets.

    5# (a) What is an A.I agent ? List the various types of A.I agent architectures ? . (b) Consider the above map. Use the A* algorithm. To work out a route from town A to town M, using the following cost functions: g(n) = The cost of each move as the distance between each town (shown on map). h(n) = The straight line distance between towns and M, (given in the table below).

    6# (a) Explain the REVERSE TURING TEST with example. (b) Given the following search tree, apply the MiniMax algorithm and - pruning technique to it and show the search tree that would be built by this algorithm. Show where the alpha and beta cuts are applied and which parts of the search tree are pruned as a result.

    Vous aimerez peut-être aussi