JERUSALEM COLLEGE OF ENGINEERING ,PALLIKARANI , CHENNAI 100

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

ACADEMIC YEAR EVEN (2017-2018)
III YEAR 6th SEM

Sub Code: CS6659

Sub Title: ARTIFICIAL INTELLIGENCE

Unit: 1
Title of the Unit: INTRODUCTION TO Al AND PRODUCTION SYSTEMS
Course objective: To understand the concepts of Artificial Intelligence and methods for
solving problems
Course Outcome: Identify and solve problems that are amenable to solution by AI
methods.

PART A

Q.N Question Year Bloom’s

Taxanomy
Level
State the advantages of Breadth-First Search
 Breadth-first search will not get trapped by following a
single, unfruitful path for a very long time.
 If there is a solution, then breadth-first search is guaranteed Nov K
1 to find it. 2017
 Longer paths are never explored until all shorter ones have
already been examined.

Define Commutative production system

It is a production system that is both monotonic and partially
commutative.

2 Nov
2017 K

3 List someof the uninformed search strategies with APRIL K

examples. 2017
1.Breadth First search
 2.Depth First search
3.Depth limited search
4.Uniform cost search

4 List down the characteristics of intelligent agent. APRIL K

2017
1. Situatedness
The agent receives some form of sensory input from
its environment, and it performs some action that
changes its environment in some way. Examples of
environments: the physical world and the Internet.
2. Autonomy
The agent can act without direct intervention by
humans or other agents and that it has control over
its own actions and internal state.
3. Adaptivity
The agent is capable of (1) reacting flexibly to
changes in its environment; (2) taking goal-directed
initiative (i.e., is pro-active), when appropriate; and
(3) learning from its own experience, its
environment, and interactions with others.
4. Sociability
The agent is capable of interacting in a peer-to-peer
manner with other agents or humans.

5 categorize the production system NOV S

 Monotonic production system- It is a production system 2016
in which the application of a rule never prevents the later
application of another rule that could also have been applied
at the time the first rule was selected.
 Partially commutative production system- It is a
production system with the property that if the application
of a particular sequence of rules transforms state x and state
y, then any permutations of those rules that is allowable
also transforms state x into state y.
 Commutative production system- It is a production
system that is both monotonic and partially commutative.

6 Define heuristics. Why are heuristics crucial for the efficient NOV K
design of an expert system? 2016
Heuristics is the study of the methods and rules of discovery and
invention. In state space search, heuristics define the rules for
choosing branches in a state space that are most likely to lead to
 an acceptable solution. There are two cases in AI searches when
heuristics are needed:
 The problem has no exact solution. For example, in
medical diagnosis doctors use heuristics to choose
the most likely diagnoses given a set of symptoms.
(medical expert systems)
 The problem has an exact solution but is too
complex to allow for a brute force solution.
Key Point: Heuristics are fallible. Because they rely on
limited information, they may lead to a suboptimal
solution or to a dead end.

7 Define ridge. MAY K

2016
The orientation of the high region, compared to the set of
available moves, makes it impossible to climb up. However, two
moves executed serially may increase the height.

8 Predict how much knowledge would be required by a perfect MAY AP

program for a problem of playing chess? Assume that 2016
unlimited computing power is available.

The knowledge required by a perfect program for a problem of

playing chess are the rules for determining legal moves and some
simple control mechanisms that implements an appropriate search
procedure. Additional knowledge about such things as good
strategy and tactics help considerably to constrain the search and
speed up the execution of the program.

9 List out the advantages of Depth-First Search algorithm? NOV K

 Depth-first search requires less memory since only the nodes 2015
on the current path are stored.
 It may find the solution without examining much of the
search space at all. The process can be stopped once the
solution is found.
10 Describe production systems. NOV C
A production system consists of: 2015

 A set of rules that describes the operations and

applicability of the rule.
 One or more knowledge/databases that contains the
informations appropriate for the particular task.
 A control strategy that specifies the order in which the rules
will be compared to the database and a way of resolving the
conflicts that arise when several rules match at once.
 A rule applier.

11 Define an Ideal rational agent. MAY K

For each possible percept sequence, an ideal rational agent should 2015
do whatever action is expected to maximize its performance
measure on the basis of the evidence provided by the percept
sequence & whatever builtin knowledge that the agent has.

12 Define a CSP NOV K

A constraint satisfaction problem or CSP is defined as a set of 2014
variables, X1, X2,……,Xn and a set of constraints C1, C2,……,Cm.
Each variable Xi has a nonempty domain Di of possible values.
Each constraint Ci involves some subset of the variables and
specifies the allowable combinations of values for that subset. A
state of the problem is defined by an assignment of values to
some or all of the variables. An assignment that does not violate
any constraints is called a consistent or legal assignment and a
solution to a CSP is a complete assignment that satisfies all the
constraints.

13 Describe Heuristic search strategy? NOV

2014
Heuristic search strategy is an AI search technique where: C
1. knowledge given and Problem specification solution is best.
2. A heuristic function is used to estimate the cost of cheapest
path from node n to a goal node.

14 List the criteria to measure the performance of search MAY K

strategies. 2014
 The criteria to measure the performance of search
strategies are:
 Completeness: is the algorithm guaranteed to find a
solution when there is one?
 Optimality: does the strategy find the optimal
solution?
 Time complexity: how long does it take to find a
solution?
 Space complexity: how much memory is needed to
perform the search?

15 How can we avoid ridge and plateau in hill climbing? Nov E

Conclude. 2012

Ridges result in sequence of local maxima that is very difficult

for greedy algorithm to navigate. A plateau is an area to the state
space landscape where the evaluation function is flat. It can be a
flat local maximum, from which no uphill exit exists, or a
shoulder, from which it is possible to make progress. In case of
plateau a sideways move is allowed in hope that the plateau is
really a shoulder. If a sideways move is always allowed an
infinite loop might occur. So a limit is placed on the number of
consecutive sideways moves allowed.

16 Define AI technique? K
Artificial Intelligence (AI) is the study of how to make
computers do things which, at the moment, people do
better.

It is a method that exploits knowledge that should be

represented in such a way that:

 The knowledge captures generalizations.

 It can be understood by people who must provide
it.
 It can be easily modified to correct errors and to
reflect changes.
 It can be used in situations even if it is not
accurate and complete.
 It helps to narrow the range of possibilities that is
has to be considered.
17 List the steps to be considered to solve a problem? K
To solve a particular problem, the following steps are
taken into account,

 Define the problem precisely.

 Analyze the problem.
 Isolate and represent the task knowledge that is
necessary to solve a problem.
 Choose the best problem-solving techniques and
apply it to a particular problem.

18 How state space representation is is related to the problem AP

solving?
The structure of state space representation corresponds to
the structure of problem solving in two important ways:

 It allows for a formal definition of a problem as

the need to convert some given situation into
some desired situation using a set of permissible
operations.
 It permits to define the process of solving a
particular problem as a combination of known
techniques. Search is a very important process in
the solution of hard problems for which no more
direct techniques are available.

19 Describe the Breadth-First Search algorithm. C

1. Create a variable called NODE-LIST and set it to the
initial state.
2. Until the goal state is found or NODE-LIST is
empty:
a) Remove the first element from the NODE-LIST
and call it E. If NODE-LIST was empty, quit.
b) For each way that each rule can match the state
described in E do,
i. Apply the rule to generate a new state.
ii. If the new state is a goal state, quit and
return this state.
Otherwise, add the new state to the end of NODE-LIST
19 List the advantages of Breadth-First Search algorithm? K
 Breadth-first search will not get trapped by
following a single, unfruitful path for a very long
time.
 If there is a solution, then breadth-first search is
guaranteed to find it.
 Longer paths are never explored until all shorter
ones have already been examined.

20 Describe the Depth-First Search algorithm. C

1. If the initial state is a goal state, quit and return
success.
2. Otherwise, do the following until success or failure is
signaled.
a) Generate the successor, E, of the initial state. If
there are no more successors, signal failure.
b) Call Depth-first search with E as the initial state.
c) If success is returned, signal success. Otherwise
continue in this loop.

21 List the different dimensions to be analyzed for a problem? K

 Is the problem decomposable into a set of
independent smaller or easier sub problems?
 Can solution steps be ignored or at least undone
if they prove unwise?
 Is the problem’s universe predictable?
 Is the good solution to the problem obvious
without comparison to all other possible
solutions?
 Is the desired solution a state of the world or a
path to the state?
 Is a large amount of knowledge absolutely
required to solve a problem, or is knowledge
important only to constraint the search?

22 State the three classes of problem? K

 Ignorable, in which solution steps can be
ignored.
 Recoverable, in which solution steps can be
undone.
  Irrecoverable, in which solution steps cannot be
undone.

23 List the important issues of general-purpose search K

techniques?
 The direction in which to conduct the search
(forward versus backward reasoning).
 How to select applicable rules (matching).
 How to represent each node in the search process
(the knowledge representation problem and the
frame problem).

24 Generate the problems faced by hill-climbing search? S

Hill-climbing often get stuck for the following reasons :
 Local maxima – A local maxima is a peak that is
higher than each of its neighboring states, but
lower than the local maximum. Hill climbing
algorithm that reach the vicinity of a local
maximum will be drawn upwards towards the
peak, but will then be stuck with nowhere else to
go.
 Ridges – Ridges result in a sequence of local
maxima that is very difficult for greedy
algorithms to navigate.
 Plateau – a plateau is an area of state space
landscape where the evaluation function is flat. A
hill-climbing search might be unable to find its
way off the plateau.

25 Define AND-OR graphs K

 AND-OR graph (or tree) are useful for
representing the solution of problems that can be
solved by decomposing them into a smaller
problems.
 One AND arc may point to any number of
successor nodes.
 Several arcs may emerge from a single node,
indicating a variety of ways in which the problem
can be solved.
 PART B
Q.N Question Year Bloom’s
Taxanomy
Level
1 Explain informed search strategies with an example. APRIL C
2017
2 Explain the process of stimulated annealing with APRIL C
example 2017
3 (i)Differentiate the following: NOV AN
1. Simple hill climbing 2017/
2. Steepest-Ascent hill climbing MAY
(ii) Describe Simulated Annealing 2016
4 Discuss and conclude the Constraint Statisfaction NOV E
problem with an algorithm for solving a 2017
Cryptarithmetic problem
5 Explainthe heuristic functions with an example MAY C
2016
6 Explain NOV AP
1. DFS algorithm with an example 2016
2. How different problem characteristics are
deduced
7 List the characteristics of a problem. Explain any four K
with examples
8 Explain AO* algorithm with an example. State the K
limitations in the algorithm

PART C
Q.N Question Year Bloom’s
Taxanomy
Level
1 Explain the constraint satisfaction procedure to solve the NOV AP
crypt arithmetic problem. 2015
CROSS
+ ROADS
DANGER
2 Solve the given problem. Describe the operators involved in MAY/ AP
it.Consider a water jug problem: You have given two jugs, a NOV
4-gallon one and a 3-gallon one. Neither have any measuring 2016
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
in to the 4-gallon jug? Explicit Assumptions: A jug can be
filled from a pump, water can be poured out of a jug on to
the ground, water can be poured from one jug to another
and that there are no other measuring devices available.
MAY 2016/DEC 2016