0% found this document useful (0 votes)
144 views2 pages

Assignment 1

The document discusses topics in artificial intelligence including state space representation, search algorithms, and the 8-puzzle problem. It provides questions about defining AI, differentiating natural and artificial intelligence, state space representation using the water jug problem, production rule systems, search techniques like depth-first search, breadth-first search, A*, best-first search, and applying A* to solve an 8-puzzle problem.

Uploaded by

1932 Parekh Jeel
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
0% found this document useful (0 votes)
144 views2 pages

Assignment 1

The document discusses topics in artificial intelligence including state space representation, search algorithms, and the 8-puzzle problem. It provides questions about defining AI, differentiating natural and artificial intelligence, state space representation using the water jug problem, production rule systems, search techniques like depth-first search, breadth-first search, A*, best-first search, and applying A* to solve an 8-puzzle problem.

Uploaded by

1932 Parekh Jeel
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/ 2

Artificial Intelligence(3170716)

Assignment 1
Chapter 1 and Chapter 2
No. Question Chapter
1 What is artificial intelligence? Define the different task domains of 1
artificial intelligence.
2 What is Intelligence? Discuss types of problems requiring 1
Intelligence to solve it. Define AI.
3 Differentiate Natural & Artificial Intelligence. Explain types of 1
problems which requires AI techniques to be solved.
4 Write a short note on “Applications of Artificial Intelligence”. 1
5 What do you mean by state space representation of a problem? 2
Illustrate how you can represent following water jug problem as a
state space search: There are two jugs (without any measuring
marks on them) of 4 and 3 liters capacity, respectively. There is a
tap of water to fill the jugs. The objective is to fill the 4-liter jug
with exactly 2 liter of water.
6 Explain the State Space with the use of 8 Puzzle Problem. 2
Or
Explain State Space Search using 8 Puzzle problem
Or
What is state space representation? Explain with an example.
7 Discuss following: State space of a problem 2
8 Consider the Water Jug problem as stated here: “You are given 2
two jugs, a 4- gallon one and a 3-gallon one. Neither has any
measuring markers on it. There is a pump that can be used to fill
the jugs with water. How can you get exactly 2 gallons of water
into the 4-gallon jug?” Represent this as a problem in State Space
Search and state its Production Rules. Show at least one solution
to this problem.
Or
Solve Water JUG problem using production Rule System

9 Explain Production system and explain what is set of rules, 2


knowledge database, A control strategy and rule applier.
10 What is Control Strategies in AI? List and explain all the control 2
strategies with example.
11 Explain any problem solved using Depth First Search technique 2
12 Differentiate the DFS and BFS with merits and demerits. 2
13 Explain A* algorithm. 2
14 Describe DFS and BFS. How can they be used for searching? Give 2
one application for which DFS or BFS can be applied for searching
the solution.
15 Define “Heuristic Search”. Explain the steps in “Best First Search” 2
and illustrate it using a suitable example.
16 Explain Depth first search and Breadth first search with example. 2
17 What is depth first search? Explain algorithm and its advantages. 2
18 Explain the Best-First-Search Procedure with example. 2
19 Consider the following initial and goal configuration for 8-puzzle 2
problem. Draw the search tree for initial three iterations of A*
algorithm to reach from initial state to goal state. Assume suitable
heuristic function for the same.
Initial state:

1 2
3 4 5
6 7 8

Goal State:

1 2 3
8 4
7 6 5

You might also like