Artificial intelligence LISP was created by? Alan Turing Marvin Minsky John McCarthy Allen Newell and Herbert Simon Alan Turing Marvin Minsky John McCarthy Allen Newell and Herbert Simon ANSWER DOWNLOAD EXAMIANS APP
Artificial intelligence A basic line following robot is based on __________ Weak Artificial Intelligence approach Strong Artificial Intelligence approach Cognitive Artificial Intelligence approach Applied Artificial Intelligence approach Weak Artificial Intelligence approach Strong Artificial Intelligence approach Cognitive Artificial Intelligence approach Applied Artificial Intelligence approach ANSWER DOWNLOAD EXAMIANS APP
Artificial intelligence Which is the most straightforward approach for planning algorithm? Depth-first search Hill-climbing search Best-first search State-space search Depth-first search Hill-climbing search Best-first search State-space search ANSWER DOWNLOAD EXAMIANS APP
Artificial intelligence An algorithm A is admissible if ___________ It guarantees to return more optimal solutions It is not guaranteed to return an optimal solution when one exists It returns more solutions, but not an optimal one It is guaranteed to return an optimal solution when one exists It guarantees to return more optimal solutions It is not guaranteed to return an optimal solution when one exists It returns more solutions, but not an optimal one It is guaranteed to return an optimal solution when one exists ANSWER DOWNLOAD EXAMIANS APP
Artificial intelligence Which search method takes less memory? Breadth-First search Depth-First Search Optimal search Linear Search Breadth-First search Depth-First Search Optimal search Linear Search ANSWER DOWNLOAD EXAMIANS APP
Artificial intelligence A heuristic is a way of trying __________ To discover something or an idea embedded in a program To compare two nodes in a search tree to see if one is better than the other is To search and measure how far a node in a search tree seems to be from a goal All of the mentioned To discover something or an idea embedded in a program To compare two nodes in a search tree to see if one is better than the other is To search and measure how far a node in a search tree seems to be from a goal All of the mentioned ANSWER DOWNLOAD EXAMIANS APP
EXAMIANS