CS4365 test 1

[Lisp] Given(setf line '(roses are red)) What is the result of: (cons (last line) line)

((red) roses are red)

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

(RED PYRAMID)

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

(cons t nil)

[Lisp] What is the lambda function to subtract 7 from a number?

(lambda (n) (- n 7))

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

(nil t nil)

[Lisp] Given(setf line '(roses are red)) What is the result of: (reverse line)

(red are roses)

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

(roses (red))

[Lisp] What is the result of: (apply #'cons '(t nil))

(t)

[Lisp] What is the result of: (eval (list '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, ... Use MINIMAX to obtain the estimate of the position at root node (Max Node).

10

[Lisp] What is the result of the following Lisp function? (length '((OPEN) (THE POD BAY DOORS) HAL))

3

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

4

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

4

[Lisp] What is the result of: (+ (- 5 2) 3)

6

[AI05] Consider the following 8-puzzle configuration of the start state and the goal state. Using a heuristic h1 (number of tiles in wrong position), What is the h1(start-state)?

8

[AI-Ch04] In nondeterministic environments, agents can apply ______ search to generate contingent plans that reach the goal regardless of which outcomes occur during execution

And-Or

[AI-Ch03] 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. The drawback of ______ is that it can get stuck going down the wrong path.

Depth-first search

[AI-Ch03] (T/F) Depth-Limited search is Complete.

False

[AI-Ch03] 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) _____ expands nodes with minimal h(N). It is not optimal but is often efficient.

Greedy best-first search

[AI-Ch03] 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

[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?

L4

[AI-Ch04] _______ is a flat area of the state-space landscape. It can be a flat local maximum, from which no uphill exit exists, or a shoulder, from which progress is possible.

Plateau

[AI-Ch04] ______ results in a sequence of local maxima that is very difficult for greedy algorithms to navigate.

Ridge

[AI-Ch03] (T/F) Breadth-First search is Optimal.

True

[AI-Ch03] (T/F) Uniform-Cost search is Optimal.

True

[AI-Ch03] 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 also sometimes called blind search.

Uninformed Search

[AIch01&02Q] The Turing Test measures intelligence as _______.

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

[AIch01&02Q] An agent performs _____.

actions

[AIch01&02Q] A rational agent _____.

acts as well as possible

[AI-Ch03] 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 is a straight line.

admissible

[AI-Ch03] 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) If h(n) is ___, then the values of f(n)=g(n)+h(n) along any path are nondecreasing.

admissible

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

admissible

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

admissible

[AIch03bQ] Minimax is a ________.

algorithm

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

are

[AIch01&02Q] An agent is _____.

autonomous and situated in an environment

[AI-Ch03] 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 Uniform-Cost search is _____.

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

[AI-Ch03] 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 Iterative-Deepening search is _____.

bd (b times d)

[AI-Ch03] 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 Depth-Limited search is _____.

bl (b times l)

[AIch03Q] AI problems tend to involve ______.

combinatorial explosion of running time

[AI-Ch03] 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 ngenerated 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

[AI03AStar] A heuristic h is ______ if for every node n, every successor n' of n generated by any action a (preserving order - triangular inequality - monotonic), h(n) ≤ c(n, a, n') + h(n')

consistent

[AI03AStar] If a heuristic h is ______, then A* using GRAPH-SEARCH is optimal.

consistent

[AIch05Q] An optimization problem finds a maximum or minimum value that satisfies a certain _____.

constraint

[AIch03Q] Optimizing search compares _____.

costs of paths

[AIch01&02Q] The most difficult environment below is ______

dynamic and partially observable

[AIch01&02Q] Rationality maximizes ______ whereas perfection maximizes actual performance.

expected performance

[AIch03Q] Combinatorial explosion is _____

exponential size of state space

[AIch03Q] One well-known strategy for state-space search is called _____.

generate and test

[AIch03bQ] A rule of thumb that guides state-space search is a(n) _____.

heuristic

[AIch03bQ] Admissibility, informedness, and monotonicity are features of all _____.

heuristics

[Lisp] What is the result of the following expression: (eq '(a b) '(a b))

nil

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

nil

[Lisp] What is the result of: (eval (list 'eval nil))

nil

[Lisp] What is the result of: (eval nil)

nil

[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".

none

[AIch03Q] 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

[AIch01&02Q] An agent receives _______ from the environment.

percepts

[AIch01&02Q] Newell and Simon hypothesized that a necessary and sufficient condition for intelligence is ______.

rationality

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

red

[AIch05Q] Local search _____.

reduces difficulty of some hard problems

[AIch01&02Q] Utility-based agents seek mainly _____

reward

[AIch03Q] A goal is a(n) ______.

set of states

[AI ch03Q] Games and puzzles are simple examples of ______

state-space search

[AIch01&02Q] The most difficult environment below is _____.

stochastic, dynamic, partially observable

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

t

[AIch03bQ] A drawback of hill climbing is _____

tendency to become stuck at local maxima

[AIch01&02Q] A well-known way to define machine intelligence is _____

the Turing Test

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

the minimax algorithm

[AI ch03Q] The breadth-first search ______.

uses a queue