Define depth limited search.

1 Answer

Answer :

The problem of unbounded tress can be avoided by supplying depth limit 1(i.e.) nodes at depth 1 are treated as if they have no successors. This is called Depth Limited search. 

Related questions

Description : Which search implements stack operation for searching the states? a) Depth-limited search b) Depth-first search c) Breadth-first search d) None of the mentioned

Last Answer : b) Depth-first search

Description : Which search algorithm imposes a fixed depth limit on nodes? a) Depth-limited search b) Depth-first search c) Iterative deepening search d) Bidirectional search

Last Answer : a) Depth-limited search

Description : Write the time & space complexity associated with depth limited search.

Last Answer : Time complexity =O (bd) ,  b-branching factor,  d-depth of tree Space complexity=o (bl)

Description : Define Depth first search.

Last Answer :  It expands the deepest node in the current fringe of the search tree.  

Description : Which search algorithm will use limited amount of memory? a) RBFS b) SMA* c) Hill-climbing search algorithm d) Both RBFS & SMA*

Last Answer : d) Both RBFS & SMA*

Description : Which algorithm is used for solving temporal probabilistic reasoning? a) Hill-climbing search b) Hidden markov model c) Depth-first search d) Breadth-first search

Last Answer : b) Hidden markov model

Description : Which of the following search belongs to totally ordered plan search? a) Forward state-space search b) Hill-climbing search c) Depth-first search d) Breadth-first search

Last Answer : a) Forward state-space search

Description : Which algorithm takes two sentences and returns a unifier? a) Inference b) Hill-climbing search c) Depth-first search d) Unify algorithm

Last Answer : d) Unify algorithm

Description : Which algorithm are in more similar to backward chaining algorithm? a) Depth-first search algorithm b) Breadth-first search algorithm c) Hill-climbing search algorithm d) All of the mentioned

Last Answer : a) Depth-first search algorithm

Description : Which search is similar to minimax search? a) Hill-climbing search b) Depth-first search c) Breadth-first search d) All of the mentioned

Last Answer : b) Depth-first search

Description : Which search is equal to minimax search but eliminates the branches that can’t influence the final decision? a) Depth-first search b) Breadth-first search c) Alpha-beta pruning d) None of the mentioned

Last Answer : c) Alpha-beta pruning

Description : Which is the most straightforward approach for planning algorithm? a) Best-first search b) State-space search c) Depth-first search d) Hill-climbing search

Last Answer : b) State-space search

Description : Which of the following algorithm is generally used CSP search algorithm? a) Breadth-first search algorithm b) Depth-first search algorithm c) Hill-climbing search algorithm d) None of the mentioned

Last Answer : b) Depth-first search algorithm

Description : The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign. a) Forward search b) Backtrack search c) Hill algorithm d) Reverse-Down-Hill search

Last Answer : b) Backtrack search

Description : A* algorithm is based on ___________ a) Breadth-First-Search b) Depth-First –Search c) Best-First-Search d) Hill climbing

Last Answer : c) Best-First-Search

Description : Which search is complete and optimal when h(n) is consistent? a) Best-first search b) Depth-first search c) Both Best-first & Depth-first search d) A* search

Last Answer : d) A* search

Description : Which method is used to search better by learning? a) Best-first search b) Depth-first search c) Metalevel state space d) None of the mentioned

Last Answer : c) Metalevel state space

Description : Which search uses only the linear space for searching? a) Best-first search b) Recursive best-first search c) Depth-first search d) None of the mentioned

Last Answer : b) Recursive best-first search

Description : Which function will select the lowest expansion node at first for evaluation? a) Greedy best-first search b) Best-first search c) Depth-first search d) None of the mentioned

Last Answer : b) Best-first search

Description : Which search uses the problem specific knowledge beyond the definition of the problem? a) Informed search b) Depth-first search c) Breadth-first search d) Uninformed search

Last Answer : a) Informed search

Description : Depth-first search always expands the ______ node in the current fringe of the search tree. a) Shallowest b) Child node c) Deepest d) Minimum cost

Last Answer : c) Deepest

Description : The time and space complexity of BFS is (For time and space complexity problems consider b as branching factor and d as depth of the search tree.) a) O(bd+1) and O(bd+1) b) O(b2) and O(d2) c) O(d2) and O(b2) d) O(d2) and O(d2)

Last Answer : a) O(bd+1) and O(bd+1)

Description : Which of the following is/are Uninformed Search technique/techniques? a) Breadth First Search (BFS) b) Depth First Search (DFS) c) Bidirectional Search d) All of the mentioned

Last Answer : d) All of the mentioned

Description : What is the space complexity of Depth-first search? a) O(b) b) O(bl) c) O(m) d) O(bm)

Last Answer : d) O(bm)

Description : Which search is implemented with an empty first-in-first-out queue? a) Depth-first search b) Breadth-first search c) Bidirectional search d) None of the mentioned

Last Answer : b) Breadth-first search

Description : Which search method takes less memory? a) Depth-First Search b) Breadth-First search c) Linear Search d) Optimal search

Last Answer : a) Depth-First Search

Description : The _______ is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour. a) Finding shortest path between a source and a destination b) Travelling ... c) Map coloring problem d) Depth first search traversal on a given map represented as a graph

Last Answer : b) Travelling Salesman problem

Description : Which search agent operates by interleaving computation and action? a) Offline search b) Online search c) Breadth-first search d) Depth-first search

Last Answer : b) Online search

Description : Which search method takes less memory? a) Depth-First Search b) Breadth-First search c) Optimal search d) Linear Search

Last Answer : a) Depth-First Search

Description :  The initial state and the legal moves for each side define the __________ for the game. a) Search Tree b) Game Tree c) State Space Search d) Forest

Last Answer : b) Game Tree

Description : Define Online Search agent. 

Last Answer : Agent operates by interleaving computation and action (i.e.) first it takes an action, and then it observes the environment and computes the next action.

Description : Define Hill Climbing search.

Last Answer : It is a loop that continually moves in a increasing value direction (i.e.) up hill and terminates when it reaches a “peak” where no neighbor has a higher value. 

Description : Define iterative deepening search.

Last Answer : Iterative deepening 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& so on.

Description : Define A* search.

Last Answer : A* search evaluates nodes by combining g(n), the cost to reach the node and h(n), the cost to get from the node to the goal. f(n) = g(n) + h(n)

Description : Define Greedy Best First Search.

Last Answer : It expands the node that is closest to the goal (i.e.) to reach solution in a quicker way. It is done by using the heuristic function: f(n) = h(n).

Description : Define Uniform cost search.

Last Answer : Uniform cost search expands the node ‘n’ with the lowest path cost instead of expanding the shallowest node. 

Description : Define Backtracking search.

Last Answer : The variant of depth first search called backtracking search. Only one successor is generated at a time rather than all successor, partially expanded node remembers which successor generate next is called Backtracking search.

Description : Define search node.

Last Answer : The root of the search tree that is the initial state of the problem is called search node. 

Description : Define search tree.

Last Answer : The tree which is constructed for the search process over the state space is called search tree. 

Description : Conventional Artificial Intelligence is different from soft computing in the sense A. Conventional Artificial Intelligence deal with prdicate logic where as soft computing deal with fuzzy logic B. Conventional Artificial ... empirical data C. Both (a) and (b) D. None of the above

Last Answer : C. Both (a) and (b

Description : Which machines will be smarter than human mind? A. Reactive machine B. Limited memory C. Theory of mind D. Self-Awareness

Last Answer : D. Self-Awareness 

Description : Which AI should understand the human emotions, people, and beliefs and be able to interact socially like humans. A. Reactive machine B. Limited memory C. Theory of mind D. None of above

Last Answer : C. Theory of mind  

Description : Self-driving car is example of ____. A. Reactive machine B. Limited memory C. Theory of mind D. None of above

Last Answer : Ans: B [Car stores recent speed of nearby cars, distance of others car, speed limit, other information to navigate the road]

Description : Which can stores past experiences or some data for short period time. A. Reactive machine B. Limited memory C. Theory of mind D. None of above

Last Answer : B. Limited memory 

Description : Google Alpha Go is example of ____. A. Reactive machine B. Limited memory C. Theory of mind D. None of above

Last Answer : A. Reactive machine 

Description : IBM’s deep blue system is example of ___. A. Reactive machine B. Limited memory C. Theory of mind D. None of above 

Last Answer : A. Reactive machine 

Description : Which machines only focus on current scenarios and react on it as per as possible best action. A. Reactive machine B. Limited memory C. Theory of mind D. None of above

Last Answer : A. Reactive machine 

Description : Which AI system not store memories or past experiences for future actions. A. Reactive machine B. Limited memory C. Theory of mind D. None of above

Last Answer : A. Reactive machine 

Description : Visual clues that are helpful in computer vision include __________ a) color and motion b) depth and texture c) height and weight d) color and motion, depth and texture

Last Answer : d) color and motion, depth and texture

Description : To which depth does the alpha-beta pruning can be applied? a) 10 states b) 8 States c) 6 States d) Any depth

Last Answer : d) Any depth