Intro to AI

The straight-line distance heuristic used above is known to be an admissible heuristic. What does this mean, and why is it important?

Admissible heuristic means that it is guaranteed to find the shortest path from initial state to goal state. It is used because it's doesn't overestimate the cost and produce the optimal outcome.

An agent's environment is said to be stochastic if the next state is completely determined by the current state and the agent's action.

False, deterministic

A general TREE-SEARCH algorithm does NOT consider all possible paths to find a solution.

False, it considers all possible paths

Greedy best-first search expands nodes with minimal h(n). It is not optimal but is often efficient.

False, it is optimal

Breadth-first search expands the deepest unexpanded node first.

False, it's by levels not depth

A rational agent is always successful when solving problems, regardless of whether a problem is deterministic or stochastic.

False, not always

(1) Which one is not a constraint satisfaction problem element. Variables Domains Constraints Heuristics

Heuristics

An intelligent agent that maximizes expected utility is said to act rationally.

True

Iterative deepening involves re-running breadth-first search repeatedly.

True

Categorize Crossword puzzle in Partially Observable or Fully Observable? a) Fully Observable b) partially Observable c) All of these d) None of these

a) Fully Observable

A problem in search space is defined by one of these states. a. Initial state b. Last state c. Intermediate state d. All of the mentioned

a. Initial state

What is the time complexity of depth-first search with branch factor b, solution depth d, and maximum search depth m? a. O(bm) b. O(bd) C. O(b^m+2) d. O(bd)

a. O(bm)

Which values are independent in minima search algorithm? a. Pruned leaves x and y b. Every states are dependent C. Root is independent d. None of the mentioned

a. Pruned leaves x and y

Mapping from percept histories to actions can be explained by which of the following? a) Perception sequence b) Agent function c) Sensors and Actuators d) The environment in which the agent is performing

b) Agent function

Which of these types of intelligent agents relies only on current conditions, making no use of historical data? a) Utility-based b) Simple reflex c) Learning d) Goal-based

b) Simple reflex

Which search algorithms expands nodes with minimal f(n) = g(n) + h(n)? a. Greedy best-first search b.A* search c. Iterative deepening search d.Depth-first search

b. A* search

Which of the following algorithm does generally use SP search algorithm? a. Breadth-first search algorithm b. Depth-first search algorithm C. Hill-climbing search algorithm d. None of the mentioned

b. Depth-first search algorithm

Which of the following types of search keep a single "current" state, and try to improve it? a. Informed search b. Uninformed search c.Local Search d. Adversarial Search

c. Local search

Hill-Climbing algorithm terminates in which of the following conditions? а. Stopping criterion met b. Global Min/Max is achieved c. No neighbor has a higher value d. All of these

c. No neighbor has a higher value

Which of the following is not an application of Artificial intelligence? a) Robots b) Handwriting Recognition c) Speech Recognition d) Content mining

d) Content mining

An agent is composed of which of the following? a) Physical Architecture b) Agent Function and Physical Architecture c) Perception Sequence d) Physical Architecture and Program

d) Physical Architecture and Program

Which of the following criteria is not part of the measuring problem-solving performance? a.Completeness b.Time complexity c.Space complexity d.Accuracy

d. Accuracy

Which value is assigned to alpha and beta in the alpha-beta pruning? а. Alpha = max b. Beta = min C. Beta = max d. Both Alpha = max & Beta = min

d. Both Alpha = max & Beta = min

Which action sequences are used to achieve the agent's goal? a. Search b.plan c. Retrieve d. Both Search & Plan

d. Search & plan