Solved MCQs for Artificial Intelligence Expert (Questions Answers).
1.Which of the following is the problem space of means-end analysis?
(A). One or more initial states and one or more goal state
(B). One or more initial states and one goal state
(C). An initial state and one or more goal states
(D). One initial state and one goal state
(E). None of these
MCQ Answer: (C). An initial state and one or more goal states
2. Cybernetics is the study of?
(A). communication between two machines
(B). communication between two humans
(C). communication between human and machine
(D). Boolean values
(E). None of these
MCQ Answer: (C). communication between human and machine
3. Which of the following is A heuristic function is a function?
(A). to solve mathematical problems
(B). that maps from problem state descriptions to measures of desirability
(C). whose return type is nothing
(D). which takes parameters of type string and returns an integer value
(E). None of these
MCQ Answer: (B). that maps from problem state descriptions to measures of desirability
4. The main goal of artificial intelligence is to?
(A). explain various sorts of intelligence
(B). solve artificial problems
(C). solve real-world problems
(D). extract scientific causes
(E). None of these
MCQ Answer: (A). explain various sorts of intelligence
5. An algorithm is considered as a complete algorithm if it?
(A). has a loop
(B). starts with a solution
(C). does not terminate with a solution
(D). terminates with a solution when one exists
(E). None of these
MCQ Answer: (D). terminates with a solution when one exists
6. An algorithm A is considered as an admissible if it?
(A). not guaranteed to return an optimal solution when one exists
(B). guarantees to return more optimal solutions
(C). returns more solutions, but not an optimal one
(D). guaranteed to return an optimal solution when one exists
(E). None of these
MCQ Answer: (D). guaranteed to return an optimal solution when one exists
7. Which can be considered as true regarding the Breadth-First Search algorithm?
(A). Breadth-First Search algorithm will get trapped exploring a single path
(B). Breadth-First Search algorithm is nothing but Binary First Search
(C). Breadth-First Search algorithm is not promised to find a solution if exists
(D). The whole tree has so far been generated must be stored in the Breadth-First Search algorithm
(E). None of these
MCQ Answer: (D). The whole tree has so far been generated must be stored in the Breadth-First Search algorithm
8. In traveling salesman problem, n cities with the paths and paths connecting the cities. The time required for traversing through all the cities, without the advance knowledge of the length of a minimum tour is considered as?
(A). O(n!)
(B). O(n2)
(C). O(n)
(D). O(n/2)
(E). None of these
MCQ Answer: (A). O(n!)
More MCQs on the sidebar of Website
Agent Architecture MCQs, Alpha Beta Pruning MCQs, Backward Chaining, Forward Chaining MCQs, Bayesian Networks MCQs, Communication, Hidden Markov Model, Image Perception MCQs,
Uninformed Search Strategy, Inductive logic programming, Informed Search Strategy, Learning,
Object Recognition, Online Search Agent, Uncertain Knowledge and Reasoning MCQs on Artificial Intelligence.
MCQs collection of solved and repeated MCQs with answers for the preparation of competitive exams, admission test and job of PPSC, FPSC, UPSC, AP, APPSC, APSC, BPSC, PSC, GOA, GPSC, HPSC, HP, JKPSC, JPSC, KPSC, KERALAPSC, MPPSC, MPSC, MPSCMANIPUR, MPSC, NPSC, OPSC, RPSC, SPSCSKM, TNPSC, TSPSC, TPSC, UPPSC, UKPSC, SPSC, KPPSC, BPSC, AJKPSC ALPSC, NPSC, LPSC, SCPSC, DPSC, DCPSC, PSC, UPSC, WVPSC, PSCW, and WPSC.
