Artificial intelligence A* algorithm is based on ___________ Hill climbing Breadth-First-Search Depth-First –Search Best-First-Search Hill climbing Breadth-First-Search Depth-First –Search Best-First-Search ANSWER DOWNLOAD EXAMIANS APP
Artificial intelligence Which search algorithm imposes a fixed depth limit on nodes? Depth-limited search Bidirectional search Depth-first search Iterative deepening search Depth-limited search Bidirectional search Depth-first search Iterative deepening search ANSWER DOWNLOAD EXAMIANS APP
Artificial intelligence The “Turing Machine” showed that you could use a/an _____ system to program any algorithmic task. Semantic Electro-chemical Recursive Binary Semantic Electro-chemical Recursive Binary ANSWER DOWNLOAD EXAMIANS APP
Artificial intelligence What is Transposition rule? From P → Q, infer Q → ~P From P → Q, infer Q → P From P → Q, infer ~Q → P From P → Q, infer ~Q → ~P From P → Q, infer Q → ~P From P → Q, infer Q → P From P → Q, infer ~Q → P From P → Q, infer ~Q → ~P ANSWER DOWNLOAD EXAMIANS APP
Artificial intelligence The action of the Simple reflex agent completely depends upon __________ Current perception Utility functions Learning theory Perception history Current perception Utility functions Learning theory Perception history ANSWER DOWNLOAD EXAMIANS APP
Artificial intelligence In LISP, the function X (x). (2x+l) would be rendered as (* lambda(x) (+2x1) (lambda (x) (+1 (* 2x) (+ lambda (x) 1 (*2x)) (lambda (x) (+(*2 x)l)) None of these (* lambda(x) (+2x1) (lambda (x) (+1 (* 2x) (+ lambda (x) 1 (*2x)) (lambda (x) (+(*2 x)l)) None of these ANSWER DOWNLOAD EXAMIANS APP
EXAMIANS