Venus International College of Technology, Gandhinagar

B. E. Vth Semester (C.E.)

Design and Analysis of Algorithm (150703)

1. Explain why analysis of algorithms is important? Explain: Worst Case, Best Case & Average
Case Complexity.
2. Define: Big Oh, Big Omega and Big Theta Notation.
3. Explain asymptotic analysis of algorithm.
4. Write a program of selection sort. What is worst complexity of the method?
5. Explain Quick sort using divide and conquer method and computer its worst case running
time.
6. What is an algorithm? Explain various properties of an algorithm.
7. What is an amortized analysis? Explain methods of its using suitable example.
8. Write an algorithm for Binary search and find worst running time.
9. Write an algorithm of merge sort and find its complexity.
10. Explain Quick sort method with example and compute its worst case running time.
11. How Divide and Conquer method help multiplying two large integers.
12. Explain Matrix multiplication with example.
13. Arrange following rate of growth in increasing order.
2N, n log n, n2, 1, n, log n, n! , n3
14. What do you mean by Asymptotic Notations? Explain.
15. Explain why the Heap sort method is called an efficient sorting algorithm.
Sort the following data using Heap sort method.
65, 77, 5, 25, 32, 45, 99, 83, 69, 81
16: Explain characteristics of Greedy Algorithm.

17.Define Minimal Spanning Tree (MST). Explain Krushkal’s Algorithm to find MST with
example.
18.Explain Dijkstra’s algorithm to find minimum distance of all nodes from a given node.
19. What is Principle of Optimality? Explain its use in Dynamic Programming Method.
20.Solve the following Knapsack Problem using Dynamic Method. Write the equation for
solving below problem.
n = 5, W = 100
Object - 1 2 3 4 5
Weight (w) - 10 20 30 40 50
Value (v) - 20 30 66 40 60

21. Using greedy algorithm find an optimal solution for knapsack instance n=7, M =
15 (P1,P2,P3,P4,P5,P6,P7)=(10,5,15,7,6,18,3) and (w1,w2,w3,w4,w5,w6,w7) =
(2, 3, 5, 7, 1, 4, 1)

22. Using greedy algorithm find an optimal schedule for following jobs with n=7 profits:

(P1,P2,P3,P4,P5,P6,P7) = (3,5,18,20,6,1,38) and deadline

(d1, d2, d3, d4, d5, d6, d7) = (1, 3, 3, 4, 1, 2, and 1)

23. What is a fractional knapsack problem? Design and analyze greedy algorithm to solve it.
24. Write and analyze Prim’s algorithm to generate minimum spanning Tree.
25. Solve the following 0/1 Knapsack Problem using Dynamic Programming. There are five
items whose weights and values are given in following arrays.
Weight w [] = {1, 2, 5, 6, 7}
Value v [] = {1, 6, 18, 22, 28}
Show your equation and find out the optimal knapsack items for weight capacity of 11 units.
26. Explain Backtracking Method. What is N-Queens Problem? Give solution of 4-Queens
Problem using Backtracking Method.
27. Explain Breadth First Traversal Method for Graph with algorithm.

28. Find all possible solution for the 4*4 chessboard, 4 queen’s problem using backtracking.

29. Design and explain Dijkstra’s shortest path algorithm.

30. Discuss how 8-queen problem can be solved using backtracking.

31. Write down the algorithm to determine articulation points in a given undirected graph. Give
any application where it is applicable.
32. Give the algorithm for Depth First Search of a Graph. Also define “Articulation Point” of the
graph and explain how to find it.
33. Explain the use of Backtracking method for solving Eight Queens Problem giving its
algorithm.
34. Define: Directed Acyclic Graph, Dense graph, sparse graph, Preconditioning.
35. Explain finite automata for string matching.

36. Explain Rabin- carp method for string matching and also give the algorithm.

37. What is polynomially Turing reducible problem? Explain with example how problem A can
be polynomially Turing reduced to problem B.
38. Explain Branch and Bound Technique in brief.

39.Solve Making Change problem using Dynamic Programming. (denominations:

d1=1,d2=4,d3=6). Give your answer for making change of Rs. 8.

40.Explain Chained Matrix Multiplication with example.

41 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

42 Describe an assembly line scheduling problem and give dynamic programming algorithm to
solve it.
43 Describe LCS problem with example and obtain optimal substructure required to solve it
using dynamic programming.
44 Give optimal substructure for make change problem. Consider an instance of such a problem
with coins 1, 4 and 6 units. Illustrate its solutions using dynamic programming approach
involving a payment of 8 units or less.
45 Solve the following 0/1 Knapsack Problem using Dynamic Programming. There are five
items whose weights and values are given in following arrays.
Weight w[] = { 1,2,5,6,7 }
Value v[] = { 1,6,18, 22, 28 }
Show your equation and find out the optimal knapsack items for weight capacity of 11 units.
46 Explain how to find out Longest Common Subsequence of two strings using Dynamic
Programming method.Find any one Longest Common Subsequence of given two strings
using Dynamic Programming.
S1=abbacdcba
S2=bcdbbcaac

47 Explain common characteristics of dynamic programming.

48 Using algorithm find an optimal parenthesization of a matrix chain product whose sequence
of dimension is ﴾5,10,3,12,5,50,6﴿ (use dynamic programming). Using algorithm determine
an Longest Common Sequence of ﴾A,B,C,D,B,A,C,D,F﴿ and ﴾C,B,A,F﴿(use dynamic
programming).
49 Explain polynomial reduction.
50 Explain different class of problems.

51 Explain in Breif:
P Problem, NP Problem, Heap Tree, Travelling Salesman Problem.

52 Compare NP-Hard with NP-Complete problems.