Skip to content
College Subject Practice · College Year 2

Backtracking practice questions — College Subject Practice · College Year 2 Algorithms

Practise backtracking with topic-based questions. Preview a sample, then start a short session.

See the question style before signup · Get instant feedback · Continue with focused practice

Try a sample question

Check your answer to see the explanation where one has been published.

Try this question
In a branch-and-bound solution to the 0/1 knapsack problem, an effective upper bound for a node is often computed using:

1 sample question · No signup needed

Something unclear? Report this question.

2
The function that checks whether a partial assignment satisfies the problem constraints in backtracking is commonly called the:
3
A key reason backtracking can still be exponential in the worst case is that:
Start a sample session

50 published questions available for this topic.