Q.1 Discuss any 2 uninformed search methods with examples.

Q.2Explain following uninformed search strategies. 1) IDDFS 2) Bidirectional

Q.3How a problem is formally defined? List down the components of it.
Q.4Describe a state space in which interative deepening search performs much
worse than depth-first search
Q.5Prove that the breadth first search is a special case of uniform cost search.
Q.6 What is uniformed search? Explain depth first search with example.

Q.7What are the five uninformed search strategies? Explain any two in detail
with example
Q.8Explain the components of problem definition with an example.
Q.9Briefly explain the search strategies in uninformed search.
Q.10 Explain the components necessary to define a problem.

Q.11 What is depth limited search? Give the recursive implementation of depth
limited search.
Q.12 Discuss recursive best first search algorithm.
Q.13 Explain the following uninformed search strategies. (Refer section 3.4)
(i) Depth first search (ii) Iterative deepening depth first search
(iii) Bidirectional search
Q.14 Explain any two informed search streategies.
Q.15 Analyze the uniformed search algorithms with respect to different criteria.
Explain heuristics for constraint satisfaction problems.
Artificial
Intelligence
(KCS071)
Question Bank
 Unit 1 -
Introduction
Ques 1: Define in your own
words: (a) intelligence (b)
artificial intelligence.
Ques 2: Write down brief
history and evolution of AI.
Ques 3: Explain Turing
Test.
Ques 4: Define in your own
words: (a) agent, (b)
rationality, (c) logical
reasoning
Question Bank

Unit 1 - Introduction

Ques 1: Define in your own words: (a) intelligence (b) artificial intelligence.

Ques 2: Write down brief history and evolution of AI.

Ques 3: Explain Turing Test.

Ques 4: Define in your own words: (a) agent, (b) rationality, (c) logical reasoning

Ques 5: Define intelligent agent. Explain various types of agent programs with suitable

example.

Ques 6: Are reflex actions (such as flinching from a hot stove) rational? Are they intelligent?

Ques 7: To what extent are the following computer systems instances of AI:

• Supermarket bar code scanners.

• Web search engines.

• Voice-activated telephone menus

Ques 8: Is AI a science, or is it engineering? Or neither or both? Explain.

Ques 9: “Surely computers cannot be intelligent—they can do only what their programmers

tell them. “Is the latter statement true, and does it imply the former?

Ques 10: “Surely animals cannot be intelligent—they can do only what their genes tell them.

“.Is the latter statement true, and does it imply the former?

Ques 11: “Surely animals, humans, and computers cannot be intelligent—they can do only

what their constituent atoms are told to do by the laws of physics.” Is the latter

statement true, and does it imply the former?

Ques 12: Explain computer vision in parlance to the artificial intelligence. Differentiate

between human and computer vision.

Ques 13: Write down the applications of AI.

Ques 14: What are PEAS in context to intelligent agents

Ques 15: What are various characteristics on an agent environment. Describe with example.

Ques 16: Write down present and future scope of AI.

Ques 17: What are various steps involved in problem solving? Explain with suitable

examples.

Ques 18: Describe the role of Artificial Intelligence in Natural Language Processing

Problem Solving
Methods
Ques 1: Explain why
problem formulation must
follow goal formulation.
Ques 2: Define in your own
words the following terms:
state, state space, search
tree, search
node.
Ques 3: Explain goal,
action, transition model,
and branching factor.
Ques 4: What’s the
difference between a
world state, a state
description, and a search
node? Why is this
distinction useful?
Ques 1: Explain why problem formulation must follow goal formulation.

Ques 2: Define in your own words the following terms: state, state space, search tree, search

node.

Ques 3: Explain goal, action, transition model, and branching factor.

Ques 4: What’s the difference between a world state, a state description, and a search

node? Why is this distinction useful?

Ques 5: Which of the following are true and which are false? Explain your answers.

1. Depth-first search always expands at least as many nodes as A∗ search with an

admissible heuristic.

2. h(n)=0 is an admissible heuristic for the 8-puzzle.

3. A∗ is of no use in robotics because percepts, states, and actions are continuous.

4. Breadth-first search is complete even if zero step costs are allowed.

Ques 6: Prove each of the

following statements, or
give a counterexample:
a.
Breadth-first search is a
special case of uniform-
cost search.
b.
Depth-first search is a
special case of best-first
tree search.
c.
Uniform-cost search is a
special case of A∗ search.
Ques 7:
Implement BFS
uninformed search for 8-
puzzle problem.
Ques 8:
Implement Uniform Cost
Search uninformed search
for 8-puzzle problem.
 Ques 9:
Implement DFS
uninformed search for 8-
puzzle problem.
Ques 10:
Implement DFS
uninformed search for 8-
puzzle problem.
Ques 11:
Implement Depth Limited
uninformed search for 8-
puzzle problem.
Ques 12:
Implement Iterative
Deepening uninformed
search for 8-puzzle
problem.
 Ques 13: Explain
in detail Greedy Informed
Search Approach with
example.
Ques 14: Explain
in detail A* Informed
Search Algorithm with
example.
Ques 15: Explain
in detail Hill Climbing Local
Search and Optimization
Algorithm with
Ques 6: Prove each of the following statements, or give a counterexample:

a. Breadth-first search is a special case of uniform-cost search.

b. Depth-first search is a special case of best-first tree search.

c. Uniform-cost search is a special case of A∗ search.

Ques 7: Implement BFS uninformed search for 8-puzzle problem.

Ques 8: Implement Uniform Cost Search uninformed search for 8-puzzle problem.

Ques 9: Implement DFS uninformed search for 8-puzzle problem.

Ques 10: Implement DFS uninformed search for 8-puzzle problem.

Ques 11: Implement Depth Limited uninformed search for 8-puzzle problem.

Ques 12: Implement Iterative Deepening uninformed search for 8-puzzle problem.
 Ques 13: Explain in detail Greedy Informed Search Approach with example.

Ques 14: Explain in detail A* Informed Search Algorithm with example.

Ques 15: Explain in detail Hill Climbing Local Search and Optimization Algorithm with
example

Logical agents
What do you mean by Recursive best-first search?
How do you solve Alpha-beta pruning problem
What is the evaluation function for Alpha-beta pruning