Artificial Intelligence Questions & Answers

Uninformed Search Strategy

This set of Artificial Intelligence MCQ focuses on Uninformed Search Strategy.
1. Which search strategy is also called as lind search!
a" Uninformed search
" Informed search
c" Sim#le refle$ search
d" All of the mentioned
%ie& Ans&er
Ans&er'a
($#lanation'In lind search) We can search the states &ithout ha*ing any additional
information. So uninformed search method is lind search.
+. ,o& many ty#es are a*ailale in uninformed search method!
a" -
" .
c" /
d" 0
%ie& Ans&er
Ans&er'c
($#lanation'The fi*e ty#es of uninformed search method are 1readth2first) Uniform2cost)
3e#th2first) 3e#th2limited and 1idirectional search.
-. Which search is im#lemented &ith an em#ty first2in2first2out 4ueue!
a" 3e#th2first search
" 1readth2first search
c" 1idirectional search
d" 5one of the mentioned
%ie& Ans&er
Ans&er'
($#lanation'1ecause of 6I67 4ueue) it &ill assure that the nodes that are *isited first &ill e
e$#anaded first.
.. When is readth2first search is o#timal!
a" When there is less numer of nodes
" When all ste# costs are e4ual
c" When all ste# costs are une4ual
d" 1oth a 8 c
%ie& Ans&er
Ans&er'
($#lanation'1ecause it al&ays e$#ands the shallo&est une$#anded node.
/. ,o& many successors are generated in ac9trac9ing search!
a" 1
" +
c" -
d" .
%ie& Ans&er
Ans&er'a
($#lanation'(ach #artially e$#anded node rememers &hich successor to generate ne$t
ecause of these condition) it uses less memory.
0. What is the s#ace com#le$ity of 3e#th2first search!
a" 7:"
" 7:l"
c" 7:m"
d" 7:m"
%ie& Ans&er
Ans&er'd
($#lanation'7:m" is the s#ace com#le$ity &here is the ranching factor andm is the
ma$imum de#th of the search tree.
;. ,o& many #arts does a #rolem consists of!
a" 1
" +
c" -
d" .
%ie& Ans&er
Ans&er'd
($#lanation'The four #arts of the #rolem are intial state) set of actions) goal test and #ath
cost.
<. Which algorithm is used to sol*e any 9ind of #rolem!
a" 1reath2first algorithm
" Tree algorithm
c" 1idirectional search algorithm
d" 5one of the mentioned
%ie& Ans&er
Ans&er'
($#lanation'Tree algorithm is used ecause s#ecific *ariants of the algorithm emed different
strategies.
=. Which search algorithm im#oses a fi$ed de#th limit on nodes!
a" 3e#th2limited search
" 3e#th2first search
c" Iterati*e dee#ening search
d" 1idirectional search
%ie& Ans&er
Ans&er'a
($#lanation'5one
1>. Which search im#lements stac9 o#eration for searching the states!
a" 3e#th2limited search
" 3e#th2first search
c" 1readth2first search
d" 5one of the mentioned
%ie& Ans&er
Ans&er'
($#lanation'It im#lements stac9 o#eration ecause it al&ays e$#ands the dee#est node in the
current tree.
Artificial Intelligence Questions & Answers
Informed Search Strategy
This set of Artificial Intelligence MCQ focuses on Informed Search Strategy.
1. What is the other name of informed search strategy!
a" Sim#le search
" ,euristic search
c" 7nline search
d" 5one of the mentioned
%ie& Ans&er
Ans&er'
($#lanation'A 9ey #oint of informed search strategy is heuristic function) So it is called as
heuristic function.
+. ,o& many ty#es of informed search method are in artificial intelligence!
a" 1
" +
c" -
d" .
%ie& Ans&er
Ans&er'd
($#lanation'The four ty#es of informed search method are est2first search) ?reedy est2first
search) A@ search and memory ounded heuristic search.
-. Which search uses the #rolem s#ecific 9no&ledge eyond the definition of
the #rolem!
a" Informed search
" 3e#th2first search
c" 1readth2first search
d" Uninformed search
%ie& Ans&er
Ans&er'a
($#lanation'Informed search can sol*e the #rolem eyond the function definition) So does it
can find the solution more efficiently.
.. Which function &ill select the lo&est e$#ansion node atfirst for e*aluation!
a" ?reedy est2first search
" 1est2first search
c" 1oth a 8
d" 5one of the mentioned
%ie& Ans&er
Ans&er'
($#lanation'The lo&est e$#ansion node is selected ecause the e*aluation measures distance
to the goal.
/. What is the heuristic function of greedy est2first search!
a" f:n" AB h:n"
" f:n" C h:n"
c" f:n" B h:n"
d" f:n" D h:n"
%ie& Ans&er
Ans&er'c
($#lanation'5one
0. Which search uses only the linear s#ace for searching!
a" 1est2first search
" Eecursi*e est2first search
c" 3e#th2first search
d" 5one of the mentioned
%ie& Ans&er
Ans&er'
($#lanation'Eecursi*e est2first search &ill mimic the o#eration of standard est2first search)
ut using only the linear s#ace.
;. Which method is used to search etter y learning!
a" 1est2first search
" 3e#th2first search
c" Metale*el state s#ace
d" 5one of the mentioned
%ie& Ans&er
Ans&er'c
($#lanation'This search strategy &ill hel#s to #rolem sol*ing efficiency y using learning.
<. Which search is com#lete and o#timal &hen h:n" is consistent!
a" 1est2first search
" 3e#th2first search
c" 1oth a 8
d" A@ search
%ie& Ans&er
=. Which is used to im#ro*e the #erformance of heuristic search!
a" Quality of nodes
" Quality of heuristic function
c" Sim#le form of nodes
d" 5one of the mentioned
%ie& Ans&er
Ans&er'
($#lanation'?ood heuristic can e constructed y rela$ing the #rolem) So the #erformance
of heuristic search can e im#ro*ed.
1>. Which search method &ill e$#and the node that is closest to the goal!
a" 1est2first search
" ?reedy est2first search
c" A@ search
d" 5one of the mentioned
%ie& Ans&er
Ans&er'
($#lanation'1ecause of using greedy est2first search) It &ill 4uic9ly lead to the solution of
the #rolem.