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
AVL trees are applied into the given situations: There are few insertion & deletion operations Short search time is required Input data is sorted or nearly sorted

This unit dealt along with the methods of physically storing data in the files. The terms fields, records & files were described. The organization types were introduced. The sev

(a) Describe the steps involved in the process of decision making under uncertainty. (b) Explain the following principles of decision making: (i) Laplace, (ii) Hurwicz. (c

Define File organization''s and it''s types

What is the best-case number of comparisons performed by mergesort on an input sequence of 2 k distinct numbers?

N = number of rows of the graph D[i[j] = C[i][j] For k from 1 to n Do for i = 1 to n Do for j = 1 to n D[i[j]= minimum( d ij (k-1) ,d ik (k-1) +d kj (k-1)

representation of links list in memory

Your program should include three components selling, buying and managing for the use of sellers, buyers and the Manager, respectively. Provide a menu for a user to enter each comp

compare two functions n and 2n for various values of n. determine when second becomes larger than first

QUESTION (a) Define a tree and list its properties. (b) By showing all your workings, draw the spanning tree for the following graph based on the Breadth-First-Search algori