AI Ch03

अब Quizwiz के साथ अपने होमवर्क और परीक्षाओं को एस करें!

bm (b times m)

[AI-Ch03] Consider Time and space complexity which are measured in terms ofb: maximum branching factor of the search treed: depth of the least-cost solutionm : 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-First search is _____.

b^d (b to the power of d)

b^l (b to the power of l)

bd (b times d)

[AI-Ch03] Consider Time and space complexity which are measured in terms ofb: maximum branching factor of the search treed: depth of the least-cost solutionm : 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 _____.

b^d (b to the power of d)

[AI-Ch03] Consider Time and space complexity which are measured in terms ofb: maximum branching factor of the search treed: depth of the least-cost solutionm : 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 Breadth-First search is _____.

bl (b times l)

[AI-Ch03] Consider Time and space complexity which are measured in terms ofb: maximum branching factor of the search treed: depth of the least-cost solutionm : 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 _____.

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

[AI-Ch03] Consider Time and space complexity which are measured in terms ofb: maximum branching factor of the search treed: depth of the least-cost solutionm : 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 _____.

False

(T/F) Depth-Limited search is Optimal.

True

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

True

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

False

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

False

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

False

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

True

[AI-Ch03] (T/F) Iterative-Deepening search is Complete.

True

[AI-Ch03] (T/F) Iterative-Deepening search is Optimal.

True

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

True

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

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.

consistent

[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 ___ condition for h(n) in A* is also called sometimes monotonicity for it preserves triangular inequality.

Breadth-first search

[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.In ______, all the nodes at depth of d (and up to d) in the search tree are expanded before the nodes at depth of (d+1).

Breadth-first search

[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.In this strategy, the root node is expanded first, then all the nodes generated by the root node are expanded next, and then their successors, and so on.

Depth-first search

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

Uninformed Search

[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.This term ______ means that they have no information about the number of steps or the path cost from the current state to the goal - all they can do is distinguish a goal state from a nongoal state.

Depth-first search

[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.______ needs to store only a single path from the root to a leaf node, along with the remaining unexpanded sibling nodes for each node on the path.

b^m (b to the power of m)

[AI-Ch03] Consider Time and space complexity which are measured in terms ofb: maximum branching factor of the search treed: depth of the least-cost solutionm : 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 Depth-First search is _____.

b^d (b to the power of d)

[AI-Ch03] Consider Time and space complexity which are measured in terms ofb: maximum branching factor of the search treed: depth of the least-cost solutionm : 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 Iterative-Deepening search is _____.

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

[AI-Ch03] Consider Time and space complexity which are measured in terms ofb: maximum branching factor of the search treed: depth of the least-cost solutionm : 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 _____.

[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) ____ is identical to UNIFORM COST SEARCH except that this uses f(n) = g(n) + h(n), instead of f(n) = g(n).

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) h(n) which is ___ is one that never overestimates the cost to reach the goal.

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

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

[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) _______ is complete and optimal, provided that h(n) is admissible (for TREE-SEARCH) or consistent (for GRAPH-SEARCH).

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)Using Straight-line distance for h(n) in Romanian routing problem is ___ because the shortest path between any two points is a straight line.

[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)____ search strategy evaluates nodes with the cost function f(n) by combining g(n) and h(n) where h(n) is never overestimated.

Time complexity

[AI-Ch03] 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 long does it take to find a solution?

Optimality

Space complexity

Completeness

Iterative Deepening Search

[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 a strategy that sidesteps the issue of choosing the best depth limit by trying all possible depth limits: first depth 0, then depth 1, then depth 2, and so on.

bidirectional search

[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 to simultaneously search both forward from the initial state and backward from the goal, and stop when the two searches meet in the middle.

Depth-first search

[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. ______ always expands one of the nodes at the deepest level of the tree. Only when the search hits a dead end (a nongoal node with no expansion) does the search go back and expand nodes at shallower levels.

Uninformed Search

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

Uniform cost search

[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. ______ modifies the breadth-first strategy by always expanding the lowest-cost node on the fringe (as measured by the path cost g(n)), rather than the lowest-depth node.

Heuristic Search

[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. Strategies called informed search strategies are also called ___.

Uniform cost search

[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. _____ finds the cheapest solution provided a simple requirement is met: the cost of a path must never decrease as we go along the path.

Depth-limited search

[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. ______ imposes a cutoff on the maximum depth of a path.

Fill the 4-gallon jug

[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 jugsG: (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) → (4, y) where x < 4

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

[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 jugsG: (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.

Empty the 3-gallon jug on the ground

[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 jugsG: (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, 0) where y > 0

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')

admissible

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

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

consistent

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

consistent

[AI03AStar] If a heuristic h is ______, then f(n) is non-decreasing along any path.

admissible

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

[AI05] Consider the following 8-puzzle configuration of the start state and the goal state.Using a heuristic H2 (the sum of Manhattan distances of all tiles from their goal positions), H2 for start-state is initially _____.

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

admissible

[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), h1 is ______.

AI Ch03

संबंधित स्टडी सेट्स

NCU sociology test #1 Brown

Pharmacology Test #1 (ADN-111)

Satyagraha

Quiz 9 History

Unit 11- Networking

Chapter 6; Comptia gcga {Cryptography notes}

History 1050: Chapter 3.2 and 3.3.

History of Animation

Toxic Substances

ch4

Unit 6: Lesson 2: LS Assignment 3

The Truman Show explanations

Chapter 31 Open-Economy Macroeconomics: Basic Concepts

Economics- Econ Final 1.0

SCMA test 1

module - 2 lower respiratory questions

Ch. 7 Sampling and Sampling Distributions

Chapter 2

5205 Praxis

TEXTBOOK: Ch. 6 - Gendered Nonverbal Communication