Artificial Intelligence (2180703) MCQs

MCQs of Problems, State Space Search & Heuristic Search Techniques

Showing 61 to 67 out of 67 Questions
4 5 6 7
61.
i. Gathering knowledge
ii. Defining problem
iii. Applying problem solving technique
iv. Forming the state space
v. Analyze the problem
What is the correct order for solving an AI problem?
(a) i. v. ii. iv. iii.
(b) i. ii. iii. iv. v.
(c) ii. v. i. iv. iii.
(d) None of the above
Answer:

Option (c)

62.
Which of the mentioned properties of heuristic search differentiates it from other searches?
(a) It provides solution in a reasonable time frame
(b) It provides the reasonably accurate direction to a goal
(c) It considers both actual costs that it took to reach the current state and approximate cost it would take to reach the goal from the current state
(d) All of the above
Answer:

Option (d)

63.
Which of the mentioned point are not valid with respect to a Cryptarithmetic problem?
(a) Constraints should be taken care of while solving the problem
(b) The text is converted from readable format to non-readable format
(c) If numbers are not sufficient, we can use special symbols like $#@% to encrypt the text
(d) None of the above
Answer:

Option (c)

64.
"The application of a rule never prevents the later application of another rule", is a characteristic of
(a) Monotonic Production System
(b) Non - monotonic Production System
(c) Commutative Production system
(d) None of the above
Answer:

Option (a)

65.
Iterative Deepening Search is a form of
(a) Depth limited Search
(b) Breadth First Search
(c) Best First Search
(d) None of the above
Answer:

Option (a)

66.
_____________ is a state that is better than all its neighboring states but is not better than some other states further away
(a) Plateau
(b) Local Maximum
(c) Global Maximum
(d) All of the above
Answer:

Option (b)

67.
Admissibility of A* algorithm is describes as,
(a) If the heuristic function never overestimates the actual cost to get to the goal, A* is guaranteed to return a least-cost path from start to goal.
(b) If the heuristic function overestimates the actual cost to get to the goal, A* is guaranteed to return a least-cost path from start to goal.
(c) if the heuristic function never underestimates the actual cost to get to the goal, A* is guaranteed to return a least-cost path from start to goal.
(d) None of the above
Answer:

Option (a)

Showing 61 to 67 out of 67 Questions
4 5 6 7