COURSE OBJECTIVES
Ø To understand and analyze some fundamental data structures, such as binary search trees, disjoint sets, and
self-adjusting lists.
Ø To understand the implementation and complexity analysis of fundamental algorithms such as RSA, primality
testing, max flow, discrete Fourier transform.
Ø To know about algorithmic issues in a variety of areas, including linear programming and game-theory.
Ø To understand and implement linear and non linear data structures in real time.
Ø To analyze the design of algorithms using various performance metrics.
SUGGESTED LIST OF EXPERIMENTS
1. Polynomial Differentiation.
2. Printing the node details level wise.
3. Searching the given element from N*N matrix using Binary search.
4. Knapsack Problem using Greedy Method.
5. Traveling salesman Problem.
6. Binary Tree Traversal.
7. Implementing RED BLACK Trees.
8. Minimum Spanning Tree using KRUSKAL’S Algorithm.
9. Minimum Spanning Tree using FLOYD – WARSHALL Algorithm.
10. Implementing Splay trees.
11. Implementing quad trees.
- Teacher: Asha P
- Teacher: RAJASHREE S