Unit - I

1.Define Algorithm explain about their criteria? Write about Asymptotic notations with examples?
2.Explain about the techniques Step Count Method and Step Table Methods that will calculate the
time complexity of an Algorithm?
3.Write about the Pseudo Code Conventions?
4.Give the algorithm for matrix multiplication and find the time complexity of the algorithm using
step – count method.
5.Give the algorithm for transpose of a matrix m x n and determine the time complexity of the
algorithm by Step-table method.
6.(a) Define an algorithm. What are the different criteria that satisfy the algorithm?
(b) Explain how algorithms performance is analyzed? Describe asymptotic notations with examples.
7.(a) What is meant by recursion?
(b) Give an algorithm to solve the towers of Hanoi problem.
8.Design an algorithm for finding maximum and minimum of a list of elements and illustrate with an
example
9.Derive Runtime Complexity of Non-Recursive Fibonacci Series algorithm using Tabular Method
UNIT-II.
1.Explain about the general abstraction for the Divide and Conquer Strategy?
2.Explain the Binary Search Algorithm? Calculate Time Complexity of it?
3.Explain the Quick Sort Algorithm? Calculate Time Complexity of it?
4.Explain the Merge Sort Algorithm? Calculate Time Complexity of it?
5.Write the procedure for locating an element by using Binary Search and find element -4 from the
below set by using the above technique: { -12, -10, -8, -6, -3, 0, 10, 20, 30}.
6.Draw the tree of calls of merge sort for the following set,(35, 25, 15, 10, 45, 75, 85, 65, 55, 5,20,
18)
7.Draw the tree of calls of merge sort for the following set310, 285, 179, 652, 351, 423, 861, 254,
450, 520 using merge sort algorithm and draw the tree of calls of merge sort
8.Draw the tree of calls of Quicksort for the following set of elements, (20, 30, 10, 40, 5, 60, 90, 45,
35, 25, 15, 55)
9.Explain about the Process of Tiling the Defective Chess Board with neat Diagrams
10.Explain the General Control Abstraction for the Greedy Technique?
11.Explain the Knapsack Problem using the Greedy Technique?
12.Define minimum cost spanning trees. Explain them with suitable example.
13.What is a Minimum Cost Spanning tree? Explain Prim’s Minimum cost spanning tree algorithm
with suitable example.
14.Explain how to find the minimum cost spanning tree by using Krushkal’s algorithm.
15.Find the optimal solution of 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).
16.Provide optimal solution for the fractional knapsack problem given below using Greedy
algorithm. Consider the maximum weight as 6 kg.
Item 1 2 3 4 5
Value 25 20 15 40 50
Weight 3 2 1 4 5
17.Explain differences between Prim’s and Kruskal’s Minimum spanning Tree algorithm. Derive the
time complexity of Kruskal’s algorithm.
UNIT-III
1.Explain the methodology of Dynamic programming. List the applications of Dynamic programming
?
2.Explain the solution for All pairs shortest path by using Dynamic Programming Design technique?
3.Explain the solution for Muiti stage Graphs by using Dynamic Programming Design technique?