Bsc CSIT Semester 5 – Design and Analysis of Algorithms – Unit 6. Backtracking
Comprehensive questions and detailed answers for Unit 6. Backtracking. Perfect for exam preparation and concept clarity.
Explain in brief the Backtracking approach for algorithm design. How it differs with recursion? Explain the N-Queen problem and algorithm using backtracking and analyze its time complexity.
Write short notes on
a. Backtracking strategy
b. Tractable and Intractable Problem
Explain the concept of backtracking. How it differ with recursion?
What do you mean by Backtracking? Explain the backtracking algorithm for solving 0-1
knapsack problem and find the solution for the problem given below:

Does backtracking give multiple solution? Trace the subset sum algorithm for the set {3,5,2,4,1} and sum=8.
Given a set A=(5,7,10,12,15,18,20}, find the subset that sum to 35 using backtracking.
Find all possible subsets of the integers that sum to 21 in the array {5,6,10,11,15} using back tracking technique.
Sample Questions
Write short notes on\ a. Backtracking strategy b. Tractable and Intractable Problem
Explain the concept of backtracking. How it differ with recursion?
What do you mean by Backtracking? Explain the backtracking algorithm for solving 0-1 knapsack problem and find the solution for the problem given below:
Does backtracking give multiple solution? Trace the subset sum algorithm for the set {3,5,2,4,1} and sum=8.
And more questions available on this page.