Analysis and Design of Algorithms Laboratory

[As per Choice Based Credit System (CBCS) scheme]

SEMESTER III
AMCEC, MCA , Dept.

Laboratory Code 16MCA38 CIE Marks 20

Number of LAB Hours/Week :01Hr Tutorial /Instructions 02 Hours Laboratory
SEE Marks 80 SEE Hours 03
CREDITS 02
Course Outcome (CO):
The students will be able to

CO1: Implement the concepts of time and space complexity, divide-and-conquer strategy,
dynamic programming, greedy and approximate algorithms.

CO2: Describe the methodologies of how to analyze an algorithm

CO3:Choose a better algorithm to solve the problems

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 Insertion 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.

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 Obtain the Topological ordering of vertices in a given graph.

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.

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.

8 Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal's
algorithm.

9 Check whether a given graph is connected or not using DFS method.

10 Find a subset of a given set S = {s1,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.

11 a). Implement Horspool algorithm for String Matching.

b). Find the Binomial Co-efficient using Dynamic Programming.

12 Find Minimum Cost Spanning Tree of a given undirected graph using Prims algorithm.

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.

Note 1: In the practical Examination student has to execute one program from a lot of all the
14 questions.
Note 2: Change of program is not permitted in the Practical Examination.