Register

# Backtracking

• recategorized by
661 views
1 votes
1 votes
Find all the possible solution for sum of subset problem for the instance m=35 and S=<1,2,5,7,8,10,15,20,25> using Backtracking.

I am totally confused hence please provide me the solution for it.
• recategorized by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
1
admin asked Mar 31, 2020
4,405 views
NIELIT 2017 DEC Scientific Assistant A - Section B: 22
Which type of algorithm is used to solve the "$8$ Queens" problem ? Greedy Dynamic Divide and conquer Backtracking
Which type of algorithm is used to solve the "$8$ Queens" problem ?GreedyDynamicDivide and conquerBacktracking
User Avatar
1 votes
1 votes
1 answer
2
LavTheRawkstar asked Apr 19, 2017
2,730 views
Generate atleast 3 solutions for 5 x 5 queen problem
Genearate atleast 3 solutions for 5 x 5 queen problem
Genearate atleast 3 solutions for 5 x 5 queen problem
User Avatar
1 votes
1 votes
1 answer
3
durgesh94 asked Jun 15, 2016
1,761 views
features that needed to implement top down parsing
Which of the following feature(s) is/are needed to implement top down parsing Source string marker Prediction making mechanism Matching and Backtracking mechanism All of the above
Which of the following feature(s) is/are needed to implement top down parsingSource string marker Prediction making mechanismMatching and Backtracking me...
User Avatar
0 votes
0 votes
1 answer
4
ManojK asked Jun 1, 2016
507 views
Compiler
The order in which alternative are tried in a backtracking parser affect the language accepted by the compiler or parser. Whether the given statement is valid? Explain with example?
The order in which alternative are tried in a backtracking parser affect the language accepted by the compiler or parser.Whether the given statement is valid? Explain wi...
User Avatar
Link Copied!