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. Write down an algorithm to insert a node in the beginning of the linked list.                         Ans: /* structure containing a link part and link part

The operations of the Symbol ADT The operations of the Symbol ADT are the following. a==b-returns true if and only if symbols a and bare identical. a symbol bin Unico

1. Give both a high-level algorithm and an implementation (\bubble diagram") of a Turing machine for the language in Exercise 3.8 (b) on page 160. Use the ' notation to show the co

I need help writing a pseudocode for my assignment can anyone help?

what are the disadvantages of sparse matrix?

explain the determination of interest rate in the classical system.

Question 1 Explain how the shuttle sort algorithm works by making use of the following list of integers:11, 4, 2, 8, 5, 33, 7, 3, 1, 6. Show all the steps. Question 2

Maximum numbers of nodes a binary tree of depth d The maximum numbers of nodes a binary tree of depth d can have is 2 d+1 -1.

Question 1 What is a data structure? Discuss briefly on types of data structures Question 2 Explain the insertion and deletion operation of linked list in detail Question

Ways to implement abstract data types A large part of the study of data structures and algorithms is learning about alternative ways to implement an ADT and evaluating alternat