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
You are given an undirected graph G = (V, E) in which the edge weights are highly restricted. In particular, each edge has a positive integer weight of either {1,2,...,W}, where W


A binary tree of depth "d" is an almost complete binary tree if  A) Every leaf in the tree is either at level "d" or at level "d-1"  B)  For any node "n" in the tree with a

In the amortized analysis, the time needed to perform a set of operations is the average of all operations performed. Amortized analysis considers as a long sequence of operations

Q. Enumerate number of operations possible on ordered lists and arrays.  Write procedures to insert and delete an element in to array.

Explain the halting problem Given a computer program and an input to it, verify whether the program will halt on that input or continue working indefinitely on it.

While BFS is applied, the vertices of the graph are divided into two categories. The vertices, that are visited as part of the search & those vertices that are not visited as part

what happen''s in my computer when i input any passage

a. In worst case the order of linear search is O (n/2) b. Linear search is more competent than Binary search. c. For Binary search, the array must be sorted in ascending orde

The time needed to delete a node x from a doubly linked list having n nodes is O (1)