University Important Questions

CS2351-Artificial Intelligence
Important university Questions
Unit-I
1) Explain in detail about the structure of different intelligent agents with algorithm?(16)
2) Explain in detail about the informed search strategies with algorithm and example.(all types)
(Greedy best first search, A* search, Memory-bounded heuristic search)
3) Explain in detail about the uninformed search strategies with algorithm and example.(all types)
(Breadth-first search, Uniform-cost search, depth-first search, Depth-limited search, Iterative deepening
depth-first search, Bidirectional search)
4) Explain AO* search algorithm with examples.(refer net) (April/May 2011)
5) Explain the following local search strategies with examples.

Hill climbing
Genetic Algorithms
Simulated annealing
Local beam search
6) What is A* search? Explain various stages of A* search with an example.
7) a) Is AI science or engineering? Or neither or both? Explain(8)

b) Explain the goal and model based reflex agents with example.(8)
8) Define constraint satisfaction problem(CSP). How CSP is formulated as a search problem? Explain
with an example.
9)Explain the constraint satisfaction procedure to solve the crypt arithmetic problem.
CROSS
+ ROADS
-------------
DANGER
--------------
10)Analyse the missionaries and Cannibals problem which is stated as follows. 3
missionaries and 3 cannibals are on one side of the river along with a boat that can
hold one or two people. Find a way to get everyone to the other side, without leaving
a group of missionaries in one place outnumbered by the cannibals in that place.
(i) Formulate a problem precisely making only those distinctions necessary to
ensure a valid solution. Draw a diagram of the complete state space.
(ii) Design appropriate search algorithm for it.
Unit-II
1) Explain the inference process in first order logic, using suitable example.(May/June2012) (16)
2) Explain unification algorithm used for reasoning under predicate logic with an example.
3) Explain the forward chaining process in detail with example. What is the need of incremental forward
chaining. (May/June 2012)
4) Explain the backward chaining process in detail with example.
5) Explain with algorithm and example :
i. Minimax algorithm (8)
ii.Alpha-Beta Pruning (8)
6) Consider the following facts

Team India
Team Australia
Final match between India and Australia
India scored 350 runs Australia score 350 runs India lost 5 wickets Australia lost 7
Wickets.
The team which scored the maximum runs wins
If the scores are same then the team which lost minimum wickets wins the match.
Represent the facts in predicate, convert to clause form and prove by resolution
"India wins the match".
7)Explain in detail about resolution with example.
Unit-III
1)(a) Explain partial order planning with example (8)(May/June 2012)

(b)Explain the process of modifying the planner for decomposition with suitable example(8)
(May/June2012)
2)Explain the concept of planning with state space research. How is it different from partial order
planning. (Nov/Dec 2011) (16)
3) What are planning graphs? Explain the methods of planning and acting in the real world(Nov/Dec
2011) (16)
4)Explain in detail about the planning and acting in the real world.
5) Explain the concept of planning graph in providing better heuristics estimates with suitable examples.
Unit-IV
1)Explain the method of handling appropriate inference in Bayesian Networks. (or)

2)Explain the method of performing exact inference in Bayesian networks(April/May 2011) (16)
3)Explain about Bayesian statistics provides reasoning under various kinds of uncertainty.(May 2013)(16)
4)Explain the concept of inference in temporal models ,HMMM and probabilistic reasoning.
Unit-V
1) Explain concept of learning using decision trees and neural network approach.(Nov/Dec 2012)
(April/May 2011) (16)
2) Explain in detail about learning from observation and explanation based learning(Nov/Dec 2011)
3) Draw the schematic of a machine translation and explain for an example problem (16)
4) Explain the concept :
i)Reinforcement learning
ii)Explanation based learning
5) Explain in detail statistical learning methods and reinforcement learning.
6) Write notes on least commitment search.
7) How to access performance of the learning algorithm.Explain.
8) Explain neural network with single layer and multilayer feed forward networks with algorithm
and example.

University Important Questions

Uploaded by

Copyright:

Available Formats

University Important Questions

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

University Important Questions

Uploaded by

Copyright:

Available Formats

CS2351-Artificial Intelligence

Important university Questions

(Greedy best first search, A* search, Memory-bounded heuristic search)

4) Explain AO* search algorithm with examples.(refer net) (April/May 2011)

5) Explain the following local search strategies with examples.

7) a) Is AI science or engineering? Or neither or both? Explain(8)

6) Consider the following facts

1)(a) Explain partial order planning with example (8)(May/June 2012)

1)Explain the method of handling appropriate inference in Bayesian Networks. (or)

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.