RQ1

Given the following statement. (setf line '(roses are red)) What is the result of the following expression? (cons (last line) line)

((red) roses are red)

What is the result of: (mapcar #'try '(135)) with the lisp function try provided: (defun try (n) (+ 2 n))

(3 5 7)

What is CADR of the following expression? ((BLUE CUBE) (RED PYRAMID))

(RED PYRAMID)

What is the result of: (list 'cons t nil)

(const t nil)

What is Lisp lambda function to subtract 7 from a number (a parameter n)?

(lambda (n) (- n 7))

What is the result of: (mapcar #'zerop '(2 0 -5))

(nil t nil)

Given the following lisp statement run (setf line '(roses are red)) What is the result of the following statement? (list (first line) (last line))

(roses (red))

Given the following statement (setf line '(roses are red)) What is the result of: (append line (list (first line)))

(roses are red roses)

What is the result of the following expression? (eval (list 'cons t nil))

(t)

What is the result of the following expression? (apply #'cons '(t nil))

(t)

[game-tree] In the game tree show below, the first level is a MAX level, the second is a MIN level, the third is a MAX level and the fourth is a MIN level. Each leaf-node shows its value for MiniMax search, and each node is labeled (from left to right) as L1, L2, ... Apply alpha-beta pruning to the tree. Some leaves need not be evaluated (to be pruned). Which will be the first leaf-node to be pruned? Tree: 10 11 9 12 14 15 13 14 5 2 4 1 3 22 20 21

10

What is the length of the following list? ((OPEN) (THE POD BAY DOORS) HAL)

3

What is the result of the following Lisp function? (length '((1 2 3)(4 5 6)(7 8 9)(10 11 12)))

4

What is the result of the following Lisp function? (length '(1 2 3 4))

4

What is the result of the following Lisp function? (length '((ONE) FOR ALL (AND (TWO (FOR ME)))))

4

What is the result of the following expression? (+ (-5 2) 3)

6

What is the result of the following expression? (+ 1 2 3)

6

Considering the following 8-puzzle configuration of the start state and the goal state. 7 2 4 1 2 5 6 3 4 5 8 3 1 6 7 8 Using a heuristic h1(number of tiles in wrong position), What is the h1(start-state)?

8

Select the best choice for the following question. Consider the cost functions for a node n as follows: g(n) - the cost to reach the node (from the start) h(n) - the cost to get from the node to the goal (often an estimate). f(n) - an evaluation function which is the sum of g(n) and h(n) _____ is identical to UNIFORM COST SEARCH except that this uses f(n) = g(n) + h(n), instead of f(n) = g(n)

A*

Select the best choice for the following question. Consider the cost function for a node n as follows: g(n)- the cost to reach the node (from the start) h(n)- the cost to get from the node to the goal (often an estimate). f(n)- an evaluation function which is the sum of g(n) and h(n) _____ search strategy evaluates nodes with the cost function f(n) by combining g(n) and h(n) where h(n) is never overestimated.

A*

[game-tree] In the game tree show below, the first level is a MAX level, the second is a MIN level, the third is a MAX level and the fourth is a MIN level. Each leaf-node shows its value for MiniMax search, and each node is labeled (from left to right) as L1, L2, ... Apply alpha-beta search to the tree. Some leaves need not be evaluated (to be pruned). After processing all the nodes below, what would be the alpha value or beta value of the node (that is, the parent of L1 and L2) shown below for alpha and beta values?

Alpha is negative infinity

In nondeterministic environments, agents can apply ____ search to generate contingent plans that reach the goal regardless of which outcomes occur during execution

And-Or

[game-tree] In the game tree show below, the first level is a MAX level, the second is a MIN level, the third is a MAX level and the fourth is a MIN level. Each leaf-node shows its value for MiniMax search, and each node is labeled (from left to right) as L1, L2, ... Apply alpha-beta search to the tree. Some leaves need not be evaluated (to be pruned). After processing all the nodes below, what would be the alpha value or beta value of the node (that is, the parent of L1 and L2) shown below for alpha and beta values?

Beta is positive infinity

The majority of work in the area of search has gone into finding the right search strategy for a problem. In our study of the field we will evaluate strategies in terms of four criteria. Select the best choice for each criteria. The drawback of ____ is that it can get stuck going down the wrong path.

Depth-first search

The majority of work in the area of search has gone into finding the right search strategy for a problem. In our study of the field we will evaluate strategies in terms of four criteria. Select the best choice for each criteria. _____ always expands one of the nodes at the deepest level of the tree. Only when the search hits a dead end (a nongoal with no expansion) does the search go back and expand nodes at shallower levels.

Depth-first search

(T/F) Depth0First search is Optimal.

False

[Alpha-Beta Pruning] For the game-tree shown below, state for which values of x the dashed branch with the scissors will be pruned. If the pruning will not happen for any value of x, then it should be "none." If pruning will happen for all values of x, select "all." Tree: 5 x 2 6

Greater than or equal to 2

Select the best choice for the following question. Consider the cost functions for a node n as follows: g(n) - the cost to reach the node (from the start) h(n) - the cost to get from the node to the goal (often an estimate). f(n) - an evaluation function which is the sum of g(n) and h(n) This ____ search strategy tries to expand the node that is closest to the goal, on the grounds that this is likely to lead to a solution quickly. Thus, it evaluates nodes by using just the heuristic function; that is, f(n) = h(n)

Greedy best-first search

Select the best choice for the following question. Consider the cost function for a node n as follows: g(n)- the cost to reach the node (from the start) h(n)- the cost to get from the node to the goal (often an estimate). f(n)- an evaluation function which is the sum of g(n) and h(n) ______ expands nodes with minimal h(N). It is not optimal but is often efficient.

Greedy best-first search

______ is sometimes called greedy local search because it grabs a good neighbor state without thinking ahead about where to go next.

Hill climbing search

An agent receives _____ from the environment.

Percepts

[AI-Ch03] There are two empty jugs, one of 4 gallons, one of 3 gallons. Fill the 4-gallon jug with 2 gallons of water. Consider how to represent states. so: (initial state) (0,0) si:: (state i) (xi,yi) where: xi is the content of 4-gallon jug, yi is the content of 3-gallon jug sG: (goal state) (2,0) Actions are to fill or empty the jugs. And the rules of actions are described as follows. Rule1. Fill jug if empty: if jug X is empty, fill jug X to the rim. Rule2. Transfer water from jug to jug: if jug X is empty and jug Y has water, then move water from jug Y to jug X where X > Y (that is, the amount of water in jug X is greater than the amount of water in jug Y). Rule3. Empty jug if it is not empty (on the ground) A state-transition from a state (xi, yi) will be its next state (xi+1, yi+1) after an action (xi, yi) →Action (xi+1, yi+1) Select the best answer (action) for each state-transition(x, y)→ (x + y, 0) where 4 ≥ (x + y) and x > 0 and y > 0.

Pour all the water from the 3-gallon jug into the 4-gallon jug

______ results in a sequence of local maxima that is very difficult for greedy algorithms to navigate.

Ridge

_____ solution is to start by shaking hard (i.e., at a high temperature) and then gradually reduce the intensity of the shaking (i.e., lower the temperature).

Simulated-annealing

The majority of work in the area of search has gone into finding the right search strategy for a problem. In our study of the field we will evaluate strategies in terms of four criteria. Select the best choice for each criteria. How much memory does it need to perform the search?

Space complexity

______ hill climbing chooses at random from among the uphill moves; the probability of selection can vary with the steepness of the uphill move.

Stochastic

The majority of work in the area of search has gone into finding the right search strategy for a problem. In our study of the field we will evaluate strategies in terms of four criteria. Select the best choice for each criteria.

Time complexity

(T/F) Uniform-Cost search is Optimal

True

The majority of work in the area of search has gone into finding the right search strategy for a problem. Select the best choice for each question. _____ finds the cheapest solution provided a simple requirement is met: the cost of a path must never decrease as we go along the path.

Uniform cost search

The majority of work in the area of search has gone into finding the right search strategy for a problem. Select the best choice for each question. _____ modifies the breadth-first strategy by always expanding the lowest-cost node on the fridge (as measured by the path cost g(n)), rather than the lowest-depth node.

Uniform cost search

The Turing Test measures intelligence as ________.

a human's inability to detect a machine's presencce

An agent performs

actions

A rational agent ______.

acts as well as possible

A reflex agent _______.

acts only on current percept

A heuristic h*(n) is ______ if for every node n, h*(n) <= h(n), where h(n) is the true cost to reach the goal state from n.

admissible

A(n) _____ heuristic never overestimates the cost to reach the goal, i.e., it is optimal.

admissible

Considering the following 8-puzzle configuration of the start state and the goal state. 7 2 4 1 2 5 6 3 4 5 8 3 1 6 7 8 Using a heuristic h1(number of tiles in wrong position), h1 is ______.

admissible

If heuristic h(n) is ______, A* using TREE-SEARCH is optimal.

admissible

Select the best choice for the following question. Consider the cost functions for a node n as follows: g(n) - the cost to reach the node (from the start) h(n) - the cost to get from the node to the goal (often an estimate). f(n) - an evaluation function which is the sum of g(n) and h(n) Using Straight-line distance for h(n) in Romanian routing problem is ____ because the shortest path between any two points in a straight line.

admissible

Select the best choice for the following question. Consider the cost function for a node n as follows: g(n)- the cost to reach the node (from the start) h(n)- the cost to get from the node to the goal (often an estimate). f(n)- an evaluation function which is the sum of g(n) and h(n) If h(n) is _____, then the values of f(n) = g(n) + h(n) along any path are nondecreasing.

admissible

Select the best choice for the following question. Consider the cost function for a node n as follows: g(n)- the cost to reach the node (from the start) h(n)- the cost to get from the node to the goal (often an estimate). f(n)- an evaluation function which is the sum of g(n) and h(n) h(n) which is ____ is one that never overestimates the cost to reach the goal.

admissible

Minimax is a ______.

algorithm

Given (setf line '(roses are red)) What is the result of: (nth 1 line)

are

An agent is ______.

autonomous and situated in an environment

Consider time and space complexity which are measured in terms of b: maximum branching factor of the search tree d: depth of the least-cost solution m: maximum depth of the state space (may be infinite) l (letter L): is the depth limit Note: C* is the cost of the optimal solution path. Select the best answer for each question. The Space complexity of Uniform-Cost search is ______.

b to the power of (1+⌊C*/ε⌋)

Consider time and space complexity which are measured in terms of b: maximum branching factor of the search tree d: depth of the least-cost solution m: maximum depth of the state space (may be infinite) l (letter L): is the depth limit Note: C* is the cost of the optimal solution path. Select the best answer for each question. The time complexity of Breadth-First search is ____.

b^d (b to the power of d)

Hill climbing is a(n) ______.

best-first search

The majority of work in the area of search has gone into finding the right search strategy for a problem. Select the best choice for each question. _____ is to simultaneously search both forward from the initial state and backward from the goal, and stop when the two searches meet in the middle.

bidirectional search

AI problems tend to involve ______.

combinatorial explosion of running time

If a heuristic h is _____, then A* using GRAPH-SEARCH is optimal.

consistent

If a heuristic h is _____, then f(n) is non-decreasing along any path.

consistent

Select the best choice for the following question. Consider the cost functions for a node n as follows: g(n) - the cost to reach the node (from the start) h(n) - the cost to get from the node to the goal (often an estimate). f(n) - an evaluation function which is the sum of g(n) and h(n) A heuristic h(n) is ___ if, for every node n and every successor X of n generated by any action A, the estimated cost of reaching the goal from n is no greater than the step cost of getting to X plus the estimated cost of reaching the goal from X.

consistent

An optimization problem finds a maximum or minimum value that satisfies a certain _____

constraint

Optimizing search compares ______.

costs of paths

The easiest environment below is _____.

deterministic, static, full observable

The most difficult environment below is _____

dynamic and partially observable

Rationality maximizes _______ whereas perfection maximizes actual performance.

expected performance

Combinatorial explosion is ______

exponential size of state space

One well-known strategy for state-space search is called _______.

generate and test

A rule of thumb that guides state-space search is a(n) _______.

heuristic

Admissibility, informedness, and monotonicity are features of all ____.

heuristics

What is the result of the following expression: (eql 3 3.0)

nil

What is the result of the following expression? (eval (list 'eval nil))

nil

A problem of finding a set of values that yields the highest or lowest return value when used as parameters to a function is _____.

optimization

Newell and Simon hypothesized that a necessary and sufficient condition for intelligence is ____.

rationality

Given (setf line '(roses are red)) What is the result of: (first (last line))

red

Local search _______.

reduces difficulty of some hard problems

Utility-based agents seek mainly ______

reward

A goal is a(n) ______.

set of states

A set of possible arrangements of values is a(n) _____.

state-space

Games and puzzles are simple examples of ______.

state-space search

What is the result of the following expression: (equal '(a b) '(a b))

t

A drawback of hill climbing is ____

tendency to become stuck at local maxima

A well-known way to define machine intelligence is _____

the Turing Test

The assumption that a game opponent will make the best possible move is made in _____.

the minimax algorithm

The depth-first search

uses a stack