Explain backtracking, Data Structure & Algorithms

Explain Backtracking

The  principal idea is to construct solutions single component  at a time  and evaluate such  partially constructed candidates as follows.

If a partially constructed solution can be developed further without violating the problem's constraints, it is completed by taking the first remaining legitimate option for the next component.

If there is no legitimate option for the next component, no alternatives for any remaining component require to be considered.  

 

Posted Date: 7/27/2013 5:59:08 AM | Location : United States







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

Write discussion on Explain backtracking
Your posts are moderated
Related Questions
Q. How can we free the memory by using Boundary tag method in the context of Dynamic memory management?

The data structure needed for Breadth First Traversal on a graph is Queue

Question: (a) Discuss the importance of game theory to decisions. (b) Explain the following: (i) saddle point, (ii) two-person zero-sum game. (c) Two leading ?rms, ABC Ltd a

Q. The reason bubble sort algorithm is inefficient is that it continues execution even after an array is sorted by performing unnecessary comparisons. Therefore, the number of comp

Q. Write down the recursive function to count the number of the nodes in the binary tree.    A n s . R ecursive Function to count no. of Nodes in Binary Tree is writt

Description A heap is an efficient tree-based data structure that can be used as a priority queue. Recall that the abstract data type of a priority queue has the following opera

A Binary Search Tree is binary tree which is either empty or a node having a key value, left child & right child. By analyzing the above definition, we notice that BST comes int

advanatges of dynamic data structure in programming

Q. Let X = (X1, X2, X3,....Xn) and Y= (Y1, Y2, Y3,....Xm) be the two linked lists respectively. Write down an algorithm to merge the lists together to get the linked list Z such th

what is an algorithms