Scribd
Upload
51 views6 pages

AI IMP Questions III-I

Uploaded by

Shanthireddy Matam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
51 views6 pages

AI IMP Questions III-I

Uploaded by

Shanthireddy Matam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

lOMoARcPSD|38245794

AI IMP Questions III-I

CSE (Data Science) (Jawaharlal Nehru Technological University, Hyderabad)

Scan to open on Studocu

Studocu is not sponsored or endorsed by any college or university


Downloaded by Shanthi Reddy Matam (shanthireddy1203@gmail.com)
lOMoARcPSD|38245794

ARTIFICIAL INTELLIGENCE (R18 III-I) QUESTION BANK

UNIT -1:
1) What are the four basic types of agent program in any intelligent system? Explain how
did you convert them into learning agents?

2) Explain the following uninformed search strategies with examples.


(a) Breadth First Search. (b) Uniform Cost Search
(c) Depth First Search (d) Depth Limited Search

3) What is PEAS? Explain different agent types with their PEAS descriptions.

4) Explain in detail the properties of Task Environments.

5) Define a problem and its components. Explain how a problem solving agent works?
Explain real-world problems with examples.

7) Explain in detail with examples


(i) Iterative deepening search (ii) Bidirectional search

8) How an algorithm’s performance is evaluated? Compare different uninformed search


strategies in terms of the four evaluation criteria.

9) What is Greedy Best First Search? Explain with an example the different stages of Greedy
Best First search.

10) What is A* search? Explain various stages of A* search with an example.

11) Explain the following local search strategies with examples.


(i) Hill climbing (ii) Genetic Algorithms (iii) Simulated annealing

12) Discuss the characteristics of AI problem. Can Towers of Hanoi problem be considered
as AI problem? Justify your answer with suitable

13) Define Artificial Intelligence. Explain the techniques of A.I. Also describe the
characteristics of Artificial Intelligence. b) Explain the state space representation of Water –
Jug problem.

14) Explain in detail about Uninformed Search and Informed Search Strategies.

15) List and explain the applications of Artificial Intelligence

16) Define the following problems. What types of control strategy is used in the following
problem. I. The Tower of Hanoi II. Crypto-arithmetic III. The Missionaries and cannibals
problems IV. 8-puzzle problem

17)Enumerate Classical “Water jug Problem”. Describe the state space for this problem and
also give the solution

Downloaded by Shanthi Reddy Matam (shanthireddy1203@gmail.com)


lOMoARcPSD|38245794

UNIT II:
1. Define constraint satisfaction problem (CSP). How CSP is formulated as a search
problem? Explain with an example.

2) Explain with examples


(i) Adversarial search problem (ii) Game

3).Differentiate between forward and backward reasoning

4) Explain with algorithm and example :


(i). Minimax algorithm (ii). Alpha-Beta Pruning

5) (i) Define the syntactic elements of first-Order logic


(ii) Illustrate the use of first-order logic to represent knowledge.

6).Give a brief note on Alpha-Beta Pruning.

7) Explain with an example


(a) forward chaining (b) Backward chaining

8) Give resolution proof for example problem statement :


(a) “West is a criminal” (b) Curiosity killed the cat

9).Differentiate propositional logic with FOL. List the inference


rules along with suitable examples for first order logic
10).Explain how values are propagated in the game tree using
MINIMAX and ALPHA-BETA pruning. Show the nodes that will
be pruned.

Downloaded by Shanthi Reddy Matam (shanthireddy1203@gmail.com)


lOMoARcPSD|38245794

UNIT III:
1,Write down logical representations for the following sentences suitable to use with
Generalized Modus Ponens: (a) Horses, cows and pigs are mammals (b) An offspring of a
horse is a horse (c) Bluebeard is a horse (d) Offspring and parent are inverse relations (e)
Every mammal has a parent. Draw the proof tree generated by an exhaustive back-ward
chaining algorithm for the query ∃h Horse(h).

2. Give a detail note on a generic knowledge-based agent. (b) In the wumpus world, agent
will have five sensors.

3. Give a detail note on models for first order logic. (b) Discuss inference rules for
quantifiers.

4.Prove the following assertion: for every game tree, the utility obtain by MAX using
minimax decision against a suboptimal MIN will be never be lower than the utility
obtainedplaying against an optimal MIN. Can you come up with a game tree in which MAX
can do still better using a suboptimal strategy against a suboptimal MIN?

5. What are the limitations of Predicate logic as a tool for Knowledge representation?
Illustrate through examples

UNIT IV:
1. Give an outline of a simple planning agent (b) Give partial-order planning algorithm.

2. Discuss about the language of planning problem briefly. (b) Explain partial order planning
in detail.

3. Give a detailed account on planning with state space search

4. Explain Bayes rule and its use

5. Explain uncertainty

6. Explain the use of planning graph in providing better heuristic estimation with suitable
example?

Downloaded by Shanthi Reddy Matam (shanthireddy1203@gmail.com)


lOMoARcPSD|38245794

7. Explain in details about first-order logic?

UNIT V:
1. Explain instance based learning with an example

2. Explain Dempster-Shafer theory.

3. Explain inductive logic Programming

4. Describe a method for constructing Bayesian networks,

5. Explain inductive logic programming

6. What is a Bayesian networks?How is it used in representing the uncertainity about


knowledge. Explain the method of performing exact inference in baeysian networks?

7. Define uncertain knowledge,prior probability and conditional probability .


State the Baye’s theorem.How it is useful for decision making under uncertainty about knowledge?
Explain the method of performing exact inference in Bayesian networks briefly.

8.Disucss indetail about supervised learning?

Downloaded by Shanthi Reddy Matam (shanthireddy1203@gmail.com)


lOMoARcPSD|38245794

Downloaded by Shanthi Reddy Matam (shanthireddy1203@gmail.com)

You might also like