Module-5: Backtracking – Review Questions

Sl. Ma VTU
No
Question rks QP
Backtracking – General Method
1 What is backtracking. Give the general Procedure. 6
N-Queens problem
2 Give the problem statement of n-queens problem. Explain the solution for 4-queens problem 6/ Jul 14,
using state space tree. 8 16, Jan
15,16
Sum of subset problem
3 Explain backtracking concept and apply it solve subset sum problem for S = {6,5,3,7} and 6 Jan 17
d=15. Draw the state space tree.
4 Apply backtracking to solve the following instance of the subset-sum problem : S={1,3,4,5} 6
and d=11. Draw the state space tree.
Graph Coloring ( new topic in CBCS scheme)
5 Apply backtracking to solve the 3-cloring problem for the graph given below. 4

6 Apply backtracking based graph coloring algorithm for the graph given below with m=4. 6
Give state space tree showing first 3 valid assignments.

Hamiltonian Cycles (New topic in CBCS Scheme)

7 Give the backtracking based algorithm to the problem of finding Hamiltonian cycle in the 6
graph.
8 Apply the backtracking to the problem of finding Hamiltonian cycle in the following graphs 6

(a) (b)
Branch and Bound- Assignment Problem
9 What branch and bound method. How it is different from backtracking. 5
10 Apply branch and bound method for the following instance of assignment problem to find the 6/ Jul 16
optimal solution. Give the complete state space tree. 8/ Jan 16
10 Jan 15
Jul 14
Branch and Bound- Travelling Sales Person problem
11 Apply the branch-and-bound algorithm to solve the travelling sales man problemfor the 6
following graph. Consider start city is A. Give the statespace tree.

12 Apply the branch-and-bound algorithm to solve the travelling sales man problemfor the 8
following graph. Start city is a. Give the statespace tree.

0/1 Knapsack problem

13 How branch and bound algorithm is different from backtracking. 3 Jul 17
14 With the help of a state space tree, solve the following instance of Knapsack problem 6 Jan 16,
by the branch and bound algorithm. Knapsack Capacity W = 10 Jan 17
Item No. 1 2 3 4
Weight 4 7 5 3
Value 40 42 25 12
15 With the help of a state space tree, solve the following instance of Knapsack problem 8
by the branch and bound algorithm. Knapsack Capacity W = 15
Item No. 1 2 3 4 5 6
Weight 5 7 2 4 5 1
Value 40 35 18 4 10 2
16 Apply Least Cost Branch and Bound (LCBB) method for the following instance of
0/1 Knapsack problem to get the optimal solution. Knapsack Capacity W = 15
Item No. 1 2 3 4
Weight 2 4 6 9
Value 10 10 12 18
17 Apply FIFO Branch and Bound method for the following instance of 0/1 Knapsack
problem to get the optimal solution. Knapsack Capacity W = 15
Item No. 1 2 3 4
Weight 2 4 6 9
Value 10 10 12 18
NP-Complete and NP-Hard problems
18 Explain the following with examples 6/ Jul 16
a. Class P Problems 8 Jan 16
b. Class NP Problems Jan 15
c. NP complete problem
d. NP hard problem.