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

Describe Binary Search Tree (BST)? Make a BST for the given sequence of numbers. 45, 36, 76, 23, 89, 115, 98, 39, 41, 56, 69, 48 Traverse the obtained tree in Preorder, Inord

What is complexity of an algorithm? What is the basic relation between the time and space complexities of an algorithm? Justify your answer by giving an example.

Tree is dynamic data structures. Trees can expand & contract as the program executes and are implemented via pointers. A tree deallocates memory whereas an element is deleted.

Implementations of Kruskal's algorithm for Minimum Spanning Tree. You are implementing Kruskal's algorithm here. Please implement the array-based Union-Find data structure.

Algorithm for deletion of any element from the circular queue: Step-1: If queue is empty then say "queue is empty" & quit; else continue Step-2: Delete the "front" element


1. Use the Weierstrass condition, find the (Strongly) minimizing curve and the value of J min for the cases where x(1) = 0, x(2) = 3. 2. The system = x 1 + 2u; where

Which sorting algorithms does not have a worst case running time of  O (n 2 ) ? Merge sort

What are stored and derived attributes?  Stored attributes: The attributes kept in a data base are called stored attributes.  Derived attributes: The attributes that are