31. Generality is the measure of _____________
32. The minimax algorithm computes the minimax decision from the current state. It uses a simple recursive computation of the minimax values of each successor state, directly implementing the defining equations. The recursion proceeds all the way down to the leaves of the tree, and then the minimax values are backed up through the tree as the recursion unwinds.
33. Which of the following "laws" is Asimov's first and most important law of robotics?
34. In LISP, the function X (x). (2x+l) would be rendered as __________
35. Which is the first AI programming language?
36. An Artificial Intelligence technique that allows computers to understand associations and relationships between objects and events is called _____________
37. What are present in the planning graph?
38. What are taken into account of state-space search?
39. What are the possible values of the variable?
40. What is called as transposition table?
Read More Section(Artificial Intelligence)
Each Section contains maximum 100 MCQs question on Artificial Intelligence. To get more questions visit other sections.