roma c A ial Intelligence (2180703) nica: MCQs of Problems, State Space Search & Heuristic Search Techniques Stoning 31 out of 7 Cuetine 21, Amare away of eng (Te dcover something oan ea bedded in program (2) To seach are mesure how far anode a seach rae sas to fom a gol {© Te compare wo nadesina search ret ne one i batter than another (eA the mentioned soon Option) 32, gorithm hase on (a Benth Fist search (Depth Fre -Sarc (6 Best Fest seen (@ i cinbing a) 33. ‘The search stategy the ses problem spc knowledges known a6 (0) nerd seach (ey Best rt Seren (© Hewiste seach (6 ofthe mentioned soos Option) ADMISSIONS OPEN 2021 Bertae Lert Posies 2A. besttntscuch eo nomed sch wee. to choose he best nt node fr expan (2) Evasion function tu (2 Evaluation fonction tuning highest evatton {6 Ean fonction retning ones ghost eatin (@) None of then appa oes Option a) 35, BestFst search on be implemented using the folowing data stucture (@ Queue (o sk (6 Penty Queue (@) Cresarqueve soon Option) 236. Hear fueson hn (@ Lowest path cost (e) cheapest path rom roto oa nee (© Fstmated costo cheapest path om roto goa node (6) Average path cos oon Option) 137. What isthe evaluation fiction in greedy approach? (@) Howse nton (ey) Fan cost tom start node tcurent node {6 Fath cost tom stat node cuent node + Hes cost (Average of Fath cost fom sa nade cunt rade ad Hewittsoo Option a) 238, _Whatisthe evaluation fnton nA approach? (a) Howie funtion (e) Fath cost tom stat node to current node (© Fath cost tom stat node cuent node + Hes cost (6) Average of Fath cost tom sta node to curent rede and Heuristic cost oo Option) 2. ‘san algo, 2 loop that continual movesia the ecto of nceaing valu that uphl (@) Up Hi search (e Hacimbing (6 Hilger (6) Reverse-Doun-illserch oo Option) 40. When wi il-cimbingalgortm terminate? (0) Stopping ction met (t) bat tiny ais acreved (© Ne neighbour has higher vale (6 ofthe mentioned sooner Option) Song ooo ees — i i eee sun @ Darshan 9BH