Artificial intelligence Which search method takes less memory? Optimal search Breadth-First search Linear Search Depth-First Search Optimal search Breadth-First search Linear Search Depth-First Search 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 Boolean Algebra Logarithm Turing Test None of these Algorithm Boolean Algebra Logarithm Turing Test None of these Algorithm ANSWER DOWNLOAD EXAMIANS APP
Artificial intelligence An expert system differs from a database program in that only an expert system: features the retrieval of stored information contains procedural knowledge contains declarative knowledge None of these expects users to draw their own conclusions features the retrieval of stored information contains procedural knowledge contains declarative knowledge None of these expects users to draw their own conclusions ANSWER DOWNLOAD EXAMIANS APP
Artificial intelligence Which search algorithm imposes a fixed depth limit on nodes? Iterative deepening search Depth-first search Bidirectional search Depth-limited search Iterative deepening search Depth-first search Bidirectional search Depth-limited search ANSWER DOWNLOAD EXAMIANS APP
Artificial intelligence A KES knowledge base contains information in the form of: free text All of these actions associations schema free text All of these actions associations schema ANSWER DOWNLOAD EXAMIANS APP
Artificial intelligence A computer program that contains expertise in a particular domain is called an: operational symbolizer automatic processor intelligent planner expert system None of these operational symbolizer automatic processor intelligent planner expert system None of these ANSWER DOWNLOAD EXAMIANS APP
EXAMIANS