Artificial intelligence Which is the most straightforward approach for planning algorithm? Hill-climbing search Depth-first search State-space search Best-first search Hill-climbing search Depth-first search State-space search Best-first search ANSWER DOWNLOAD EXAMIANS APP
Artificial intelligence In LISP, which of the following function assigns the value 10 to the symbol a? (a = 10) (d) (setq 10 a) (setq a 10) (a = b) where b = 10 None of these None of these (a = 10) (d) (setq 10 a) (setq a 10) (a = b) where b = 10 None of these None of these ANSWER DOWNLOAD EXAMIANS APP
Artificial intelligence In which of the following situations might a blind search be acceptable? None of these small search space All of these real-life situation complex game None of these small search space All of these real-life situation complex game ANSWER DOWNLOAD EXAMIANS APP
Artificial intelligence Two literals are complementary if _____________ They are identical but of opposite sign They are equal They are identical and of equal sign They are unequal but of equal sign They are identical but of opposite sign They are equal They are identical and of equal sign They are unequal but of equal sign ANSWER DOWNLOAD EXAMIANS APP
Artificial intelligence A.M. turing developed a technique for determining whether a computer could or could not demonstrate the artificial Intelligence,, Presently, this technique is called None of these Boolean Algebra Algorithm Turing Test Logarithm None of these Boolean Algebra Algorithm Turing Test Logarithm ANSWER DOWNLOAD EXAMIANS APP
Artificial intelligence What is the evaluation function in A* approach? Heuristic function Average of Path cost from start node to current node and Heuristic cost Path cost from start node to current node + Heuristic cost Path cost from start node to current node Heuristic function Average of Path cost from start node to current node and Heuristic cost Path cost from start node to current node + Heuristic cost Path cost from start node to current node ANSWER DOWNLOAD EXAMIANS APP