Artificial Intelligence (2180703) MCQs

MCQs of Problems, State Space Search & Heuristic Search Techniques

Showing 31 to 40 out of 67 Questions
1 2 3 4 5 6
31.
A heuristic is a way of trying ___________
(a) To discover something or an idea embedded in a program
(b) To search and measure how far a node in a search tree seems to be from a goal
(c) To compare two nodes in a search tree to see if one is better than another
(d) All of the mentioned
Answer:

Option (d)

32.
A* algorithm is based on ___________
(a) Breadth-First-Search
(b) Depth-First –Search
(c) Best-First-Search
(d) Hill climbing
Answer:

Option (c)

33.
The search strategy the uses a problem specific knowledge is known as ___________
(a) Informed Search
(b) Best First Search
(c) Heuristic Search
(d) All of the mentioned
Answer:

Option (d)

34.
Best-First search is a type of informed search, which uses ________________ to choose the best next node for expansion.
(a) Evaluation function returning lowest evaluation
(b) Evaluation function returning highest evaluation
(c) Evaluation function returning lowest & highest evaluation
(d) None of them is applicable
Answer:

Option (a)

35.
Best-First search can be implemented using the following data structure.
(a) Queue
(b) Stack
(c) Priority Queue
(d) Circular Queue
Answer:

Option (c)

36.
Heuristic function h(n) is ________
(a) Lowest path cost
(b) Cheapest path from root to goal node
(c) Estimated cost of cheapest path from root to goal node
(d) Average path cost
Answer:

Option (c)

37.
What is the evaluation function in greedy approach?
(a) Heuristic function
(b) Path cost from start node to current node
(c) Path cost from start node to current node + Heuristic cost
(d) Average of Path cost from start node to current node and Heuristic cost
Answer:

Option (a)

38.
What is the evaluation function in A* approach?
(a) Heuristic function
(b) Path cost from start node to current node
(c) Path cost from start node to current node + Heuristic cost
(d) Average of Path cost from start node to current node and Heuristic cost
Answer:

Option (c)

39.
_______________ Is an algorithm, a loop that continually moves in the direction of increasing value – that is uphill.
(a) Up-Hill Search
(b) Hill-Climbing
(c) Hill algorithm
(d) Reverse-Down-Hill search
Answer:

Option (b)

40.
When will Hill-Climbing algorithm terminate?
(a) Stopping criterion met
(b) Global Min/Max is achieved
(c) No neighbour has higher value
(d) All of the mentioned
Answer:

Option (c)

Showing 31 to 40 out of 67 Questions
1 2 3 4 5 6