Artificial Intelligence (2180703) MCQs

MCQs of Problems, State Space Search & Heuristic Search Techniques

Showing 11 to 20 out of 67 Questions
1 2 3 4 5 6
11.
What is the major component/components for measuring the performance of problem solving?
(a) Completeness
(b) Optimality
(c) Time and Space complexity
(d) All of the mentioned
Answer:

Option (d)

12.
Which search method takes less memory?
(a) Depth-First Search
(b) Breadth-First search
(c) Linear Search
(d) Optimal search
Answer:

Option (a)

13.
Which is the best way to go for Game playing problem?
(a) Linear approach
(b) Heuristic approach (Some knowledge is stored)
(c) Random approach
(d) An Optimal approach
Answer:

Option (b)

14.
Which search strategy is also called as blind search?
(a) Uninformed search
(b) Informed search
(c) Simple reflex search
(d) All of the mentioned
Answer:

Option (a)

15.
Which search is implemented with an empty first-in-first-out queue?
(a) Depth-first search
(b) Breadth-first search
(c) Bidirectional search
(d) None of the mentioned
Answer:

Option (b)

16.
When is breadth-first search is optimal?
(a) When there is less number of nodes
(b) When all step costs are equal
(c) When all step costs are unequal
(d) None of the mentioned
Answer:

Option (b)

17.
How many parts does a problem consists of?
(a) 1
(b) 2
(c) 3
(d) 4
Answer:

Option (d)

18.
Which search algorithm imposes a fixed depth limit on nodes?
(a) Depth-limited search
(b) Depth-first search
(c) Iterative deepening search
(d) Bidirectional search
Answer:

Option (a)

19.
Strategies that know whether one non-goal state is “more promising” than another are called ___________
(a) Informed & Unformed Search
(b) Unformed Search
(c) Heuristic & Unformed Search
(d) Informed & Heuristic Search
Answer:

Option (d)

20.
Which data structure conveniently used to implement BFS?
(a) Stacks
(b) Queues
(c) Priority Queues
(d) All of the mentioned
Answer:

Option (b)

Showing 11 to 20 out of 67 Questions
1 2 3 4 5 6