Escolar Documentos
Profissional Documentos
Cultura Documentos
SESSION-2009-10
Question Bank
Artificial Intelligence
UNIT I
1. What is knowledge? With the help of block diagram, explain the different
components of knowledge based system
2. What is AI technique? Explain different AI techniques
3. Explain Turing Test with suitable diagram.
4. What are task domains of artificial intelligence? Explain with example.
5. What is knowledge? Give the difference between data and knowledge. With the
help of block diagram. Explain the components of knowledge based system.
6. Explain the difference between Data, knowledge, belief and hypothesis.
7. Explain the physical symbol system hypothesis.
UNIT II
3. Write the difference between depth-first search and breadth first search.
13. What is state space? Give state space representation for water- jug problem.
14. Write the algorithm for the following heuristics search techniques:
i) Generate and Test
ii) Means end analysis.
UNIT III
1. Write and explain resolution algorithm for predicate logic. Explain with a suitable
example.
2. Explain the differences between procedural and declarative knowledge.
3. Write short note on
i) Logic programming
ii) Forward and backward reasoning.
7. Represent the following statements in predicate logic and convert any one of them
clause form:
i) Everyone is loyal to someone.
ii) All Romans were either loyal to Caesar or hated him.
9. Write and explain resolution algorithm for predicate logic. Explain its working with
suitable example.
10. Explain the term “Inference Engine”.
11. What are the different terms for steps converting WFF to its equivalent clause form.
12. Write set of production rules for following problem:
In the midst of the journey, a farmer along with his goat, a wolf and a cabbage to a
river that they must cross. There is a boat on the near side of the river, but it is only large
enough to accommodate the farmer and one other item. The farmer must contrive a
sequence of river crossing that will result in safe crossing. Following symbols are used to
represent elements of given system: F,W,G,C
States are represented as
(<symbols of elements of near side>-<symbols of elements of far side>).
State whether forward or backward reasoning is applicable and why
i) Fault finding expert system
ii) Medical expert system.
14. Suppose that we are attempting to resolve the following the following clauses:
loves(father(a), a)
¬ loves(y,x) ν loves(x,y)
a) What will be the result of the unification algorithm when to clause 1 and the first
term of clause 2?
b) What must be generated as a result of resolving these two clauses?
15. What problems would be encountered in attempting to represent the following
statements in predicate logic? It should be possible to deduce the final statement from the
others.
• John only likes to see French movies
• It’s safe to assume a movie is American unless explicitly told otherwise.
• The Playhouse rarely shows foreign films
• People don’t do things that will cause them to be in situations that they
don’t like.
• John doesn’t go to the Playhouse very often.
16. Trace the operation of the unification algorithm on the following pairs of
literals:
a) f(Marcus) and f(Caesar)
b) f(x) and f(g(y))
c) f(Marcus, g(x,y)) and f(x, g(Caesar, Marcus))
UNIT IV
13 Explain CYC.
16. What is fuzzy logic? How it is used for decision making under uncertainty?
UNIT V
1. What is learning?
2. Define Learning.
16. What are the different approaches in concept learning? Explain any one of
them.
19. With the help of block diagram explain the components of a typical Expert
System.
21. What do you mean by expert system shell? State its advantages.
26. For each of the following task, determine whether the inference engine should
use forward backward chaining:
a) Designing a layout of a house.
b) Diagnosing patient for a disease.
UNIT VI
12. “The minimax search procedure is a depth first, depth limited procedure.”
Comment.
13. Explain the alpha beta pruning strategy with suitable example.
15. How would the minimax procedure have to be modified to be used by a program
playing a three- or four- person game rather than a two-person game.