This document contains information about an IA test for the subject ADA that will take place on May 8th, 2013. It provides instructions for students, including that the test is 50 marks and lasts 1.5 hours. Students must answer any 5 of the 8 questions provided, with each question worth 10 marks. The questions cover various algorithms and problems, including n-queens problem, subset sum problem, knapsack problem, travelling salesman problem, Hamiltonian circuits, assignment problem, and list ranking.
This document contains information about an IA test for the subject ADA that will take place on May 8th, 2013. It provides instructions for students, including that the test is 50 marks and lasts 1.5 hours. Students must answer any 5 of the 8 questions provided, with each question worth 10 marks. The questions cover various algorithms and problems, including n-queens problem, subset sum problem, knapsack problem, travelling salesman problem, Hamiltonian circuits, assignment problem, and list ranking.
This document contains information about an IA test for the subject ADA that will take place on May 8th, 2013. It provides instructions for students, including that the test is 50 marks and lasts 1.5 hours. Students must answer any 5 of the 8 questions provided, with each question worth 10 marks. The questions cover various algorithms and problems, including n-queens problem, subset sum problem, knapsack problem, travelling salesman problem, Hamiltonian circuits, assignment problem, and list ranking.
SUB CODE: 10MCA44 DATE: 8/5/2013 SUB NAME: ADA TIME: 1.30 Hrs SECTION: 4 A MARKS: 50
Note: Answer any 5 questions each carries 10 marks
1. Explain how Backtracking can be used t solve n-queens problem. Find the solution to -queens problem and write an also to place all queens on the chessboard. 2. What is a state-space tree? Draw the state-space tree of the backtracking also applied to the instance s= {1, 3, 4, 5} and m=15 of the subset sum problem? 3. What is knapsack problem? Solve the following knapsack problem using branch and bound given the following data: capacity of knapsack m=12. item weight profit 1 4 10 2 6 15 3 3 6 4 4 8 5 2 4
4. Solve the following instances of the travelling salesman problem using nearest neighbor algorithm.
5. Apply the branch and bound also to solve the travelling salesperson problem for the following.
6. Find the Hamiltonian Circuit for the following 7. Solve using Assignment Problem. 8. Explain List ranking in detail.