VIDHYADEEP INSTITUTE OF MANGEMENT AND TECHNOLOGY, ANITA.

[KIM]
COMPTER ENGG. DEPARTMENT
Advance .Net Technology (150703)
Assignment 1 ( 5
th
Sem ) (Chapter-5)
1. Write the equation for finding out shortest path using Floyds algorithm. Use Floyds method to find shortest
path for below mentions all pairs
0 3
2 0
7 0 1

2. Given two sequences of characters P=<MLNOM>,Q=<MNOM>Obtain the longest common subsequence.
3. Given the four matrix find out optimal sequence for multiplication D=<5,4,6,2,7>
4. Given coins of denominations 2,4 and 5 with amount to be pay is 7.Find optimal no. of coins and sequence of
coins used to pay given amount using dynamic method.
5. Solve following knapsack problem using dynamic programming algorithm with given capacity W=5, Weight
and Value are as follows : (2,12),(1,10),(3,20),(2,15).
6. Solve the following 0/1 Knapsack Problem using Dynamic Programming Method. Write the equation for
solving the problem. n = 5, W = 11
Object _ 1 2 3 4 5
Weight (w) _ 1 2 5 6 7
Value (v) _ 1 6 18 22 28
7. Solve Making Change problem using Dynamic Programming. (denominations:d1=1,d2=4,d3=6). Give your
answer for making change of Rs. 8.
8. Find Longest Common Subsequence using Dynamic Programming Technique with illustration
X={A,B,C,B,D,A,B} Y={B,D,C,A,B,A}
9. Define: Optimal Solution, Feasible solution, Principle of Optimality.Explain Chained Matrix Multiplication with
example.

10. Describe an assembly line scheduling problem and give dynamic programming algorithm to solve it.
11. Consider the chain of matrices A1,A2,..,A6 with the dimensions given below. Give the optimal
parenthesization to get the product A2..A5
Matrix Dimension
A1 30 X 35
A2 35 X 15
A3 15 X 5
A4 5 X 10
A5 10 X 20
A6 20 X 25


Date Of Assignment Submission:



Faculty Name & Signature :













VIDHYADEEP INSTITUTE OF MANGEMENT AND TECHNOLOGY, ANITA. [KIM]
COMPTER ENGG. DEPARTMENT
Advance .Net Technology (150703)
Assignment 2( 5
th
Sem ) (Chapter-6)

1. Write pseudo code for the basic depth first search algorithm.
2. Differentiate BFS and DFS.
3. Explain how backtracking is used to solve four queen problem. Show the state space tree.
4. Explain: Articulation Point, Graph, Tree
5. What is Recursion? Give Recursive algorithm for Tower of Hanoi Problem and give analysis of it.
6. Explain Backtracking Method giving example of N-Queens Problem. Give the solution tree for 4-Queens
Problem.
7. Explain in brief Breadth First Search and Depth First Search Traversal techniques of a Graph.
8. Define: Acyclic Directed Graph, Articulation Point, Dense Graph, Sparse Graph.
9. Explain Min Max Principle
10. Discuss how 8-queen problem can be solved using backtracking.
11. Write down the algorithm to determine articulation points in a given undirected graph. Give any
application where it is applicable.
12. Construct an implicit tree for 0-1 Knapsack problem. Give backtracking algorithm to solve it

Date Of Assignment Submission:
Faculty Name & Signature














VIDHYADEEP INSTITUTE OF MANGEMENT AND TECHNOLOGY, ANITA. [KIM]
COMPTER ENGG. DEPARTMENT
Advance .Net Technology (150703)
Assignment 3( 5
th
Sem ) (Chapter-7, Chapter-8)
1. Explain in Breif:
P Problem, NP Problem, Heap Tree, Travelling Salesman Problem
2. Explain finite automata for string matching.
3. Explain Rabin- carp method for string matching and also give the algorithm.
4. Explain use of Branch & Bound Technique for solving Assignment Problem.
5. Compare NP-Hard with NP-Complete problems.

Date Of Assignment Submission:
Faculty Name & Signature