AI Multiple Choice

Goal-based Planning Agent

Actions are based on an objective, like a destination or winning a game.

Simple-Reflex Agent

Actions are based on current state and rules, ignoring past percepts.

Relaxation

An admissible heuristic can be found through _______ of the search problem.

Actuators

For a spam filter agent, marking an email message as span is part of its:

Environment

For an automated taxi driver, pedestrians are part of its

Crossover

Individuals are represented by 6 bits. Two parents 000111 and 101010 generate children 101111 and 000010. This is an example of ___ in genetic algorithms.

h3 = max{h1,h2}

Let h1 and h2 be admissible heuristics. Which is admissible and dominates h1 and h2? a. h3 = min{h1,h2} b. h3 = max{h1,h2} c. h3 = h1 + h2 d. h3 = (h1+h2)/2

0.125

State s has 4 successors A,B,C,D with slopes 3,4,-2,1, respectively from s. Stochastic Hill climbing by slope to upward successors will choose D as the next state with what probability?

Heap

The Data Structure used for the open list of greedy best-first search is a

Queue

The data structure used for the open list is of breadth-first search is a

0.23

The fitness value of 0101, 1110, and 0011 are 57, 29, and 42 respectively. Selection is done stochastically in proportion to fitness. What is the probability that 1110 is chosen as the first parent?

Episodic

Which of the following is an incorrect description of the environment of a poker player? a. Partially Observable b. Strategic c. Episodic d. Static e. Multi-Agent

F values are non-decreasing

Let h be an admissible and consistent heuristic for an A* search. What happens as states are removed from the open list?

Temperature is Hot

When does the annealing schedule of Simulated Annealing allow more worsening moves

having a depth bound on the search

Which best describes why the horizon effect occurs with the minimax algorithm? a. large branching factors at nodes b. having a depth bound on the search c. inadequate utility function d. inadequate state representation

All of the Above

Which local strategy allows search to escape local extrema and plateaus? a. simulated annealing b. mutation c. random-restart d. all of the above

Deterministic

Which of the following is an incorrect description of a taxi driver agent? a. deterministic b. dynamic c. multi-agent d. partially observable e. sequential

Completeness

A property of a search algorithm when it always finds a solution when one exists.

Mutation

After a cross-over a chromosome should be 0110100 but it turned out to be 0111100 as a result of

Performance Measure

For an automated taxi driver, the amount of gas consumed is part of its:

Beam Search

The genetic algorithm is like ___ since only the fittest k individuals survive each generation.