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
Q. Describe the basic concept of binary search technique? Is it more efficient than the sequential search?         Ans : The bin ary search technique:- This tec

Here is a diagram showing similarities between documents; this is an actual set of physics lab assignments from a large university. Each node (square) in the graph is a doc

Postorder traversal of a binary tree struct NODE { struct NODE *left; int value;     /* can take any data type */ struct NODE *right; }; postorder(struct NODE

There are three kinds of tree traversals, namely, Postorder , Preorder and Inorder. Preorder traversal: Each of nodes is visited before its children are visited; first the roo

What is Keyed Access- Container A collection may allow its elements to be accessed by keys. For instance, maps are unstructured containers which allows their elements to be

Ans: I nsertion into the B-tree: 1.  First search is made for the place where the new record must be positioned. As soon as the keys are inserted, they are sorted into th

What is Efficiency of algorithm? Efficiency of an algorithm can be precisely explained and investigated with mathematical rigor.  There are two types of algorithm efficiency

#question.show that the following inequality is correct or incorrect. n!=O(n^n)

Q. Write down an algorithm to merge the two sorted arrays into the third array. Do  not perform the sort function in the third array.                           Ans: void m

Data records are stored in some particular sequence e.g., order of arrival value of key field etc. Records of sequential file cannot be randomly accessed i.e., to access the n th