Professional Documents
Culture Documents
Q.4
Explain
the
brief
various
applications of A.I.?
Ans: There are various application of AI
but few are listed below: 1) Game Playing
2) Natural Language Processing 3) Vision
4) Robotics 5) Expert System
1) Game Playing: The first operations
game playing program in addition to simply
playing the game. Through this application
we can play the games on the PC. We can
do the enhancement on these games. The
basic idea behind this technique is, we have
to increase our intelligency through playing
PC games like chess.
2) Natural Language Processing (NLP):
Language is a media for communicating
with the world. The largest part of human
communication occur through speech.
NLP
includes
understanding
&
generation as well as other task such as
x 2 dx
3x dx
Sin 2 x Cos 2 x dx
1 Cos 2 x Cos 2 x dx
3 k dx
Condit
ion
After
Applies
on Jugs
(4, y)
Meaning / Description
(x, y)
If x<4
(x, y)
If y<3
(x, y)
(x, 3)
If y>0
(x, y)
(x, y-d)
If x>0
(x, y)
(x-d, y)
If x>0
(x, y)
(0, y)
If y>0
(x, y)
(x, 0)
(4, y-(4x)
If
x+y4
& y>0
(x, y)
(x-(3-y),
3)
Pour water from the 4gallon jug into the 3gallon jug until the 3gallon jug is full.
If
x+y3
& x>0
(x, y)
(x+y, 0)
10
If
x+y4
& y=0
(x, y)
(0, x+y)
11
If x+y
&
x>0
(0, 2)
(2, 0)
Cos 2 x dx
3x 2
2
Cos 4 x dx
1 1 Cos 2 x dx
2
1
1
2
1 dx Cos x dx
2
2
multilinked translation steps in which the
process of NLP words.
i) Morphological Analysis: Individual
words analyze into their components & non
word taken such as punctuation are
separated.
ii) Syntactic Analysis: It will check the
grammar like: it will reject if the English
sentence is Boy the go to the school.
iii) Semantic Analysis: Here mapping is
made through semantic between syntactic
analysis and objects.
iv) Discovers Integration: It will check the
dependent sentences and current the bugs
lies in these two or more sentences.
4) Robotics: Robotics is a collection of
intelligent components i.e. surprisingly
animate & perform the task as per situation.
The architecture of robotics is given as.
Perc
eptio
n
Cog
nitio
n
Sr
x3
3
Acti
on
P
h
ys
ic
al
W
or
ld
The
above
block
works as
per given instruction to perform the task as
human being performs.
5) Expert System: An expert system is a
programs that manipulates encoded
knowledge to solve problem in a
specialized domain that normally requires
human expertise.
Through expert system we can use in the
following area:
Medical Diagnosis
S/W development
Planning experiments in Bio-Chemistry
experiments
Forecasting
Identification of chemical components
Scheduling of customer
Diagnosis of complex electronic &
electromechanical system
Statement: You are given two jugs, a 4gallon 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 4-gallon jug.
The state space for this problem can be
described as the set of ordered pairs of
integer(x,y) such that x=0,1,2,3, or 4 and
y=0,1,2 or 3; x Represent the number of
gallons of water in 4-gallon jug, and y
Represents the quantity of water in the 3gallon jug.
The start state is(0,0). The goal state is
(2,n) for any value of n (since the problem
does not specify how many gallons need to
be in the 3 gallon jug).
The following same nations are given
which are used in water jug problem
solving:
> (Generator) Quantity of water is more
than gallon jug. < (Lesser) Quantity of
water is less
(-) or d Detection of water + Adding
water in the jug.
Production Rules of the water Jug problem:
Gallons in the
4-Gallon Jug
0
Gallons in the
3-Gallon Jug
0
Why, explain?
Ans: 1) A set of rules, each consisting of a
left side (a pattern that determines the
applicability of the rule and right side that
describes the operation to be perform if the
rule is applied. 2) One or more
knowledge/databases that contains whatever
information is appropriate for the particular
task. Some parts of the database may be
permanent, while other parts of it may
pertain only the solution of the current
problem. The information in this databases
may be structured in any appropriate way.
3) A control strategy that specify the order
in which the rules will be compared to the
database and a way of resolving he conflict
that arise when several rules are match at
once. 4) A rule applier.
Definition of Production System: The
production system encompasses a great
many systems, including our description of
both a chess player and a water jug problem
solver. It also encompasses a family of
general production system interpreters.
Rule Applied
2
9
2
7
5 or 12
9 or 11
following example:
Figure: h' Underestimates h
Assume that the cost of all area is 1,
initially all nodes except A are on OPEN
(although the fig. shows the situations tow
steps later, after B& E have been expanded)
for each node f' is indicated as the sum of g
& h'. initially node B has lowest value F', 4,
so it is expanded first. Suppose it has only
one successor E, and its successor F, E is 3
moves away from goal. Now f'(E) is 5, the
same as f'(c). Now we will expand E next.
Suppose it has f single successor. And the
cost of f(F) is 6 which is grater than the
f(c) is 5. so we will expand c next. Thus
we see that by underestimating h(B) we
have wasted some effort.
2) h' Overestimates h:
3)
REVIEW OF ALGORITHMS:
1) BFS 2) DFS 3) GENERATE & TEST
4) Hill Climbing 5) Steepest Hill Climbing
6) Simulated Annealing 7) Best First
Search 8) A* 9) Agenda 10) AND-OR 11)
AO* 12) Constraints Satisfaction 13)
Mean-end analysis.
Q. Compairision:
a) BFS & DFS b) Steepest Hill Climbing
& Best First Search c) Generate and Test
& Simple Hill Climbing:
Q. What are the similarities between BFS
& DFS?
Q. Explain the various criteria to built an
AI systems?
Ans: The answer of this questions is above
4 points (1) (2) (3) & (4) by giving example
of each step we can elaborate the answer.
Heuristic Search Techniques
DFS
Checks initial state
is goal, if yes quit &
return success.
DO:
Generate
successor E, if no
successor failure.
If success is return
then
stop
else
continue in loop.
4)
2)
BFS
Creation
of
NODELIST as
initial node.
Remove
element call it
E.
if
node
NODELIST
empty quit.
Apply rule to
generate
new
state if goal quit
else add it in
NODELIST.
Simulated
Annealing
Find initial state,
if it is a goal
quit
else
continue
initial state as
current state.
Initialize BESTSO-FAR
to
current state.
3)
Initialize T
annealing
schedule.
4)
select
an
operator
E = (value of
current) (value
of new state)
is ! goal but
better then call it
BEST-SO-FAR
to this new state
If ! better then
set
P'(probability)
range [0, 1] if P'
< number then
accept otherwise
do nothing.
Revice T as
per S.A.
Return
BESTSO-FAR
5)
Keywords:
Initialize State,
goal
state,
current
state,
BEST-SO-FAR,
P', T, E = Value
of current New
Value
A*
Start with OPEN by
considering h', f'. h
values, set CLOSED
to empty list.
DO: if no node
failure else pick from
OPEN
paste
in
CLOSED
call
BESTNODE. If it is
goal quite. Else
generate successor of
BESTNODE.
Set backward line
to point back to
SUCCESSOR
from
BESTNODE.
Compute g = g + cost
of
getting
from
BESTNODE
IF SUCCESSOR
already present quit to
other and call OLD.
We can leave OLD
else check backward
links its parent node.
If successor node is
better than OLD then
set this node as
current by checking
the values f', g & h.
Keywords:
Keywords:
NODELIST E,
SUCCESSOR
SUCCESSOR
utilized? Explain?
Q11. Write an algorithm of DFS? & its advantages?
Q12. Why DFS search technique to most suitable than
BFS?
Q13. Using an appropriate heuristic search technique
solve the following 8-puzzle problem?
Q14. Explain generate and test algorithm with the
example.
Q15. Explain simple Hill climbing algorithm?
Q16. Explain Steepest- A scent Hill Climbing Algorithm?
Q17. Give the meaning of the following terms: a) Local
Maximum b) Plateau c) Ridge
Q18. Write down the Algorithm for simulated annealing.
Q19. Explain with the example Best-First-Search
Algorithms?
Q20. Explain A* Algorithm?
Q21. What are the basic three components are necessary
to implement A* algorithm.
Q22. What are the two components of heuristic function
f'? Explain with the suitable example?
Q23. Explain with the suitable example h' under estimates
and overestimates and value of h? Or What are the
observations can determine after evaluation of A*
algorithm?
Q24. Write an algorithm of Agenda driven search
technique? What are the two things mainly needed to
implement this algorithm?
Q25. Write an algorithm AND-OR graph or problem
reduction with the example
Q26. What are the limitations of problem reduction
technique explain with example?
Q27. Write an algorithm of AO* searching technique &
explain the working of following terms in AO*.
1) Graph 2) INIT 3) FUTILITY 4) NODE 5) S 6)
CURRENT 7) SUCCESSOR.
Q28. Explain the Constraints satisfaction algorithm:
Q29. What is Constraints satisfaction? Trace the
constraints satisfaction procedure to solve the following
Cryptarimatic problem:
Q30: Write an algorithm of means ends Analysis?
a) BFS & DFS b) Steepest Hill Climbing & Best First
Search c) Generate and Test & Simple Hill Climbing:
d) Simulated Annealing & A*
Q. What are the similarities between BFS & DFS
Q. Explain the various criteria to built an AI systems
Sr.
1)
2)
If successor is new
in OPEN chack it into
CLOSED LIST trns
call OLD node. Then
propagate DF finding
f' value. If ! present
put it into OPEN, add
it into BESTNODEs
successors compute: f'
= g + h'.
Keywords:
Initial
state goal current
OPEN,
CLOSE,
BESTNODE, OLD, f',
g, h' SUCCESSORS.
Keywords: No
such keywords
are used.
Sr.
No.
1)
2)
Q. Write in brief about the AI techniques which are
required for solving problem?
Q.4 Explain the brief various applications of A.I.?
Q2. Explain, what are the AI problem characteristics?
Discuss in brief.
Q3. Illustrate the decomposable technique for problem
solving?
Q5. Describe how branch and bound techniques could be
used to find an optimal solution of an AI problem
implement this technique to find the optimal solution of
the following problem.
Q6. Describe the four factor consisted by a production
system?
Or What do you mean by production system? What are
he elements of production system?
Or Set of rules, knowledge databases, control strategy
and rule applier really a important factor of production
system? Why, explain?
Q7. What are the requirements of a good control strategy
for an AI system? OR What are the contents of good
control strategy? Why good control strategy should cause
motion and why? It is systematic?
Q8. Explain the importance of state space search and
problem space search in AI?
Q9. What do you mean by BFS? Write an Algorithm for
BFS?
Generate and
Test
Generate
possible
solution
considering
problem
space.
Test if this is
the goal node
by comparing
initial & goal
node [which is
generated]
Steepest
Hill
Climbing
Find initial state, if
it is a goal return a
quit else initial
state.
LOOP: Solution is
found:
Apply operator to
generate new start.
New is goal, quit,
else mark it SUC if
it is better then
previous mark SUC
else leave.
If SUC is better
than current state
than mark current
state to SUCC.
Keywords:
initial
state, goal state,
SUC, current state,
successor.
Generate
its
successor
SUCCESSOR
Evaluate before?
If not add it OPEN.
If generated
before, change the
parent
and process
from step (2).
Keywords:
initial
states, goal state,
OPEN, current state,
successor