Sri Shridevi Charitable Trust (R) SHRIDEVI INSTITUTE OF ENGINEERING AND TECHNOLOGY, TUMKUR-06 (An ISO 9001:2000 Certified

Institution) Sira Road, Tumkur 572 106. Karnataka. DEPARTMENT OF INFORMATION SCIENCE & ENGINEERING Academic Year 2011-12 (Odd Semester) LABORATARY PLAN Staff : Punitha Rajkumari P/Mallikarjunaswamy N J Subject: Algorithms Laboratory
Sl.No 1.
Date Week-1

Class/Sem: ISE/ V Code: 06CSL58

TOPIC

1. Implement Recursive Binary search and Linear search and determine the time required to search an element. Repeat the experiment for different values of n, the number of elements in the list to be searched and plot a graph of the time taken versus n. 2.Sort a given set of elements using the Heapsort method and determine the time required to sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n. 3.Sort a given set of elements using Merge sort method and determine the time required to sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n. 4.Sort a given set of elements using Selection sort and determine the time required to sort elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n. 5.Implement 0/1 Knapsack problem using dynamic programming. 6.From a given vertex in a weighted connected graph, find shortest paths to other vertices using Dijkstra's algorithm. 10.Find a subset of a given set S = {sl,s2,.....,sn} of n positive integers whose sum is equal to a given positive integer d. For example, if S= {1, 2, 5, 6, 8} and d = 9 there are two solutions{1,2,6}and{1,8}.A suitable message is to be displayed if the given problem instance doesn't have a solution. 7.Sort a given set of elements using Quick sort method and determine the time required sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n.
Lab Internal - 1

2.

Week-2

3.

Week-3

4.

Week-4

5.
6.

Week-5 Week-6

7.

Week-7

8.Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal's algorithm. 12.Find Minimum Cost Spanning Tree of a given undirected graph using Prims algorithm. 9.a) Print all the nodes reachable from a given starting node in a digraph using BFS method. b) Check whether a given graph is connected or not using DFS method.

8.

Week-8

9.

Week-9

11.a. Implement Horspool algorithm for String Matching. b. Find the Binomial Co-efficient using Dynamic Programming. 13.a) Implement Floyds algorithm for the All-Pairs- Shortest-Paths problem. b) Compute the transitive closure of a given directed graph using Warshall's algorithm. 14.Implement N Queen's problem using Back Tracking.
Revision Lab Internal-2 Final Lab Internal

10. 11. 12. 13. 14.

Week-10

Week-11 Week-12 Week-13 Week-14

Staff Incharge

Head, Dept of ISE

Principal