(ARTIFICIAL INTELLIGENCE BASED QUESTION)

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