(ARTIFICIAL INTELLIGENCE BASED QUESTION)

Find out the wrong statements:-

a)All heuristic searches are ensured to reduce the search time

b)All heuristic searches find in general finds a local solution

c)All heuristics guranteed to coverage towards the goal

d)Any heuristic is always ensured to find out a goal either optimal or non optimal

e)All heuristics are ensured to find out the exact goal.

f)Ordinary computers outperforms human intelligence in decision making

g)human intelligence outperforms ordinary computer in solving ambiguity and contradiction

h)Ordinary computers outperforms human intelligence in making sense of relative priority of data while storing

i)Human intelligence outperforms ordinary computer in intution, refelx,seixth sense.

j)Predicate logic is a technique to represent a problem

k)State space representation is a technique to represent a problem

l)A production system has one or more contorl strategy

m)Depth first iterative deepening search should never fall into a blind alley

n)Breadth first search may find a optimal solution

o)Breadth first search can find out the optimal solution

p)Steepest Ascent hill climbing is guranteed to find out a solution

q)Sometime the inference by abduction is completey certain

r)Consistent knowledge base has the property of nonmonotonicity

s)"A->B" indicates A ia the necessary condition of B

t)Any inheritable knowledge is bascically a semantic knowledge

u)Cnclusion made by inheritence has no uncertainty

v)In A* heuristic both the difficulties of underestimation and overestimation of h' value can be oversome by setting h'=0

w)In AO* heuristic the g value may be non zero in case the state space representation is a tree

x)Paralellism is applicabe in breadth first search

y)Computation of penetrance is useless in case of best first search

z)Computation of penetrance is useful for relative and path problems

2) YES OR NO:-

i)Computation of penetrance is useful for all types of problem

ii ) Dempster shafer theory is a superset of bayesian theory

iii)In solving a problem it is possible to replace linear planning by non linear planning

iv)Reactive planning is best suited for ignorable and recoverble problem

v)Discovery based learning and unguided learning are same

vi)There is no conceptual difference betoween path problem and relative problem

vii) If the gal is lying at the extreme left end of the stae space representation of a problem and closed at the leaf nodes then depth first iterative deepening search is best suited