Explain state space tree, Data Structure & Algorithms

Explain State Space Tree

If it is convenient to execute backtracking by constructing a tree of choices being made, the tree is known as a state space tree. Its root indicates an initial state before the search for a solution begins.

 

Posted Date: 7/27/2013 6:21:15 AM | Location : United States







Related Discussions:- Explain state space tree, Assignment Help, Ask Question on Explain state space tree, Get Answer, Expert's Help, Explain state space tree Discussions

Write discussion on Explain state space tree
Your posts are moderated
Related Questions
Best Case: If the list is sorted already then A[i] T (n) = c1n + c2 (n -1) + c3(n -1) + c4 (n -1)  = O (n), which indicates that the time complexity is linear. Worst Case:

What is quick sort?   Answer Quick sort is one of the fastest sorting algorithm used for sorting a list. A pivot point is chosen. Remaining elements are divided or portio

Generally, Computational complexity of algorithms are referred to through space complexity (space needed for running program) and time complexity (time needed for running the progr

What is a linear array? An array is a way to reference a series of memory locations using the similar name. Every memory location is shown by an array element. An  array elemen

Searching is the procedure of looking for something: Finding one piece of data that has been stored inside a whole group of data. It is frequently the most time-consuming part of m

Complexity classes All decision problems fall in sets of comparable complexity, called as complexity classes. The complexity class P is the set of decision problems which ca

Let a be a well-formed formula. Let c be the number of binary logical operators in a. (Recall that ?, ?, ?, and ? are the binary logical operators). Let s be the number of proposit


adjacency multilist

how do we use 4-discs stack to solve tower of hanoi problem and write an algorithm to solve it?