31. How the decision tree reaches its decision?
32. When is breadth-first search is optimal?
33. Translate the following statement into FOL.
"For every a, if a is a PhD student, then a has a master degree"
"For every a, if a is a PhD student, then a has a master degree"
34. General algorithm applied on game tree for making decision of win/lose is ____________
35. How can be the goal is thought of in backward chaining algorithm?
36. Computational learning theory analyzes the sample complexity and computational complexity of __________
37. The Task Environment of an agent consists of ____________
38. Which of the following algorithm is generally used CSP search algorithm?
39. In a rule-based system, what is the form of procedural domain knowledge?
40. Which of the following places would be LEAST likely to include operational robots?
Read More Section(Artificial Intelligence)
Each Section contains maximum 100 MCQs question on Artificial Intelligence. To get more questions visit other sections.