Scribd
Upload
19 views4 pages

Assignment 3,4,5-1

Uploaded by

deekshithaseepana15
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
19 views4 pages

Assignment 3,4,5-1

Uploaded by

deekshithaseepana15
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

UNIT-1

1. Give the control abstraction for Greedy method.


2. Explain in detail about Greedy method and Write the applications of Greedy method.
3. Explain Fractional Knapsack Problem with an example.
4. Find an optimal solution to the knapsack instance n =7, m = 15, (p1, p2, …p7) = (10, 5, 15, 7,
6, 18, 3) and (w1, w2, … w7) = (2,3,5,7,1,4,1)
5. Explain Job Sequencing with deadlines with an example.
6.

7. Explain Prim’s Algorithm for finding minimal spanning tree with an example.
8.

9. Explain Kruskal’s Algorithm for finding minimal spanning tree with an example.
10.

11. Explain about Optimal Storage on Tapes with a suitable example.


12.

13. Explain Huffman Codes with a suitable example


14.

15. Explain Single Source Shortest Path Algorithm with an example.


16.
Unit Q. No’s Roll No’s
3 1,2 67-69
3 3,4 70-72
3 5,6 73-75
3 7,8 76-78
3 9,10 79-81
3 11,12,13 82-84
3 14,15,16 85-87

UNIT-2

1. Give the control abstraction of Dynamic Programming strategy.


2. Explain in brief the control abstraction for Dynamic Programming with relevant examples.
3. Explain how Matrix chain Multiplication problem can be solved using Dynamic Programming
with suitable example.
4. "Find the minimum no of operations required for the following Chain Matrix Multiplication
using dynamic programming.
5. A = 50 X 10, B = 10 X 40, C = 40 X 30 and D = 30 X 5."
6.

7.

8.

9.

10. Explain Bellman-Ford single shortest path problem with example.


11.
12. Solve the 0/1 Knapsack problem using Dynamic Programming for number of objects n=4,
m=30, Weights (w1, w2, w3, w4) = (10,15,6,9) and Profits (p1, p2, p3, p4)=(2,5,8,1).
13. "Obtain the optimal solution to knapsack problem by Dynamic Programming method for n=4,
(p1, p2,p3,p4)=(1,2,5,6),(w1,w2,w3,w4)=(2,3,4,5) and m=8."
14. Describe travelling sales person problem and discuss how it solves using Dynamic
Programming.
15.

16. Describe reliability design problem with an example.


17.

Unit Q. No’s Roll No’s


4 1,2 88-92
4 3,4 93-96
4 5,6 97-A0
4 7,8 A1-A4
4 9,10,11 A5-A8
4 12,13,14 A9-B2
4 15,16,17 B3-B6

UNIT 3:

1. Write the control flow of a Backtracking Algorithm and explain in detail the problems that
can be solved using this approach.
2. Solve the 8-Queen problem with the help of Backtracking. Show the complete set of
possible cases in this approach.
3. Solve the following Sum of Subsets problem. Let w = {5,7,10,12,15,18,20} and m = 35. Find
all possible subsets of w that sum to m.
4. Solve sum of subsets problem using back tracking for n = 4 (w1,w2,w3,w4) = (11,13,24,7) &
m = 31. Find all possible subsets of w that sum to m using the backtracking algorithm for
sum of subsets problem.
5. Briefly explain the function that is used to find the next color in graph coloring problem.
6. Describe graph coloring problem. Give an example.
7.
8. Write an algorithm to determine the Hamiltonian Cycle in a given graph using backtracking
9. Explain FIFO Branch and Bound solution.
10. Discuss various methodologies of Branch and Bound technique.
11. Draw the portion of the state space tree generated by LC Branch and Bound for the
knapsack instance: n=5, (p1, p2, ..., p5) = (10, 15, 6, 8, 4), (w1, w2, ..., w5) = (4, 6, 3, 4, 2),
and m = 12.
12. "Generate LC branch and bound solution for the given knapsack problem, m = 15,
13. n = 4, (P1, P2, P3,P4) = (10, 10,12,18) and (w1, w2, w3,w4) = (2,4,6,9)."
14.

15. By taking your own 5x5 cost matrix explain the working of Travelling sales person problem
using Branch and Bound.
16. Explain the differences between NP complete and NP-hard problems.
17. How to determine whether a problem is NP-Hard or P? Illustrate with an example.

Unit Q. No’s Roll No’s


5 1,2 B7-B9
5 3,4 C0-C2
5 5,6 C3-C5
5 7,8 C6-C8
5 9,10,11 C9,D0,L7
5 12,13,14 L8-L11
5 15,16,17 L12,L13,L14,21-
B1

You might also like