ORIENTAL INSTITUTE OF SCIENCE & TECHNOLOGY, BHOPAL

DEPARTMENT OF INFORMATION TECHNOLOGY

ASSIGNMENT-II

Branch/Semester Session JUN-DEC 2017

IT/III
Name of Faculty Subject ADA
ANAMIKA JOSHI
Units Sub Code IT-3002
2.5
Date of Submission 15/11/17

S.No Question Marks CO Attainment

1 Explain Dynamic programming. Explain CO3

multistage graph algorithm.
2 Write a backtracking algorithm for 8 queens CO4
problem.
3 Find a Hamiltonion circuit using backtracking CO4
method.

4 Explain Travelling Salesperson problem using CO5

branch and bound. Generate a state space tree
for the following cost matrix:

5 Draw the portion of state space tree generated CO5

by LC branch and bound for the following
knapsack instance
n = 4, (P1, P2, P3, P4) = (10, 10, 12, 18), (w1, w2,
w3, w4) = (2, 4, 6, 9) and m = 15.