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
Definition of Algorithm Algorithm must have the following five characteristic features: 1.      Input 2.      Output 3.      Definiteness 4.      Effectiveness 5

How can the third dimension be displayed on the screen The main problem in visualization is the display of three-dimensional objects and scenes on two-dimensional screens. How

Write an algorithm for getting solution to the Tower's of Hanoi problem. Explain the working of your algorithm (with 4 disks) with appropriate diagrams. Ans: void Hanoi(int

Explain how two dimensional arrays are represented in memory. Representation of two-dimensional arrays in memory:- Let grades be a 2-D array as grades [3][4]. The array will

How sparse matrix stored in the memory of a computer?

Circular Queues:- A more efficient queue representation is get by regarding the array Q(1:n) as circular. It becomes more convenient to declare the array as Q(O: n-1), when  re

What is quick sort? Quick sort is a sorting algorithm that uses the idea if split and conquer. This algorithm chooses an element called as pivot element; search its position in

how to design a cache simulator with 4-way set associative cache

Q. Show the various passes of bubble sort on the unsorted given list 11, 15, 2, 13, 6           Ans: The given data is as follows:- Pass 1:-     11   15   2     13

Comparison Techniques There are several techniques for determining the relevancy and relative position of two polygons. Not all tests may be used with all hidden-surface algori