Which function will select the lowest expansion node atfirst for evaluation?
A) greedy best-first search
B) best-first search
C) both a & b
D) none of the mentioned
Correct Answer:
Verified
Q6: Chance Nodes are represented by,
A)disks
B)squares
C)circles
D)triangles
Q7: End Nodes are represented by,
A)disks
B)squares
C)circles
D)triangles
Q8: How the decision tree reaches its decision?
A)single
Q9: What is the other name of informed
Q10: How many types of informed search method
Q12: What is the heuristic function of greedy
Q13: Which search uses only the linear space
Q14: Which method is used to search better
Q15: Which search is complete and optimal when
Q16: Which is used to improve the performance
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents