DESIGN AND ANALYSIS OF ALGORITHMS

LABORATORY
Time: 2 hrs for each subpart
IA marks: 40
Lab 0 week: Practice concepts of C Language.
Week 1
Lab 1. Implement fibbonaci series and factorial program
Recursively.
Lab 2. Implement Tower of Hanoi, for different values of n.
Calculate the order of growth of computation time.
Week 3
Lab 3. Implement Strassens matrix multiplication for any order
matrices. Compute the execution time for different values of n.
Week 4
Lab 4. Sort a given set of elements using the Quick 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.
The elements can be read from a file or can be generated using
the random number generator.
Lab 5. Implement Binary Search. Compute the execution time for
different values of n.
Week 5
Lab 6. Sort a given set of elements using the 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.
The elements can be read from a file or can be generated using
the random number generator.

Lab 7. Preparation of File

Week 6-7
Lab 8-10. Greedy Method:
a) Knapsack problem
deadlines

b) Job sequencing with

c) Minimum spanning Trees (Prims Algorithm)

Algorithm

d) Kruskals

e) Single source shortest paths

Week 8-9
Lab 11-14. Dynamic Programming:
a) Optimal binary search trees

b) 0/1 Knapsack

c) Traveling salesperson problem

d) All pair shortest path
problem (Bellman and Floyds Algorithm)
Week 10-11
Lab 15-17. Back Tracking:
a) N queen's problem

b) Graph coloring

c) Hamiltonian cycles
Week 12
Lab 18-19. Branch-And-Bound:
a) 0/1 Knapsack
problems

b) Traveling Salesperson