Artificial intelligence A problem in a search space is defined by one of these state. Last state Intermediate state Initial state All of the mentioned Last state Intermediate state Initial state All of the mentioned ANSWER DOWNLOAD EXAMIANS APP
Artificial intelligence LISP machines also are known as: None of these AI workstations All of these time-sharing terminals super mini computers None of these AI workstations All of these time-sharing terminals super mini computers ANSWER DOWNLOAD EXAMIANS APP
Artificial intelligence Which search method takes less memory? Optimal search Linear Search Depth-First Search Breadth-First search Optimal search Linear Search Depth-First Search Breadth-First search ANSWER DOWNLOAD EXAMIANS APP
Artificial intelligence Which is true regarding BFS (Breadth First Search)? BFS will get trapped exploring a single path BFS is nothing but Binary First Search BFS is not guaranteed to find a solution if exists The entire tree so far been generated must be stored in BFS BFS will get trapped exploring a single path BFS is nothing but Binary First Search BFS is not guaranteed to find a solution if exists The entire tree so far been generated must be stored in BFS ANSWER DOWNLOAD EXAMIANS APP
Artificial intelligence The Face Recognition system is based on? Weak Artificial Intelligence approach Strong Artificial Intelligence approach Applied Artificial Intelligence approach Cognitive Artificial Intelligence approach Weak Artificial Intelligence approach Strong Artificial Intelligence approach Applied Artificial Intelligence approach Cognitive Artificial Intelligence approach ANSWER DOWNLOAD EXAMIANS APP
Artificial intelligence Where does the Hidden Markov Model is used? None of the mentioned Both Speech recognition & Understanding of real world Speech recognition Understanding of real world None of the mentioned Both Speech recognition & Understanding of real world Speech recognition Understanding of real world ANSWER DOWNLOAD EXAMIANS APP
EXAMIANS