Syllabus
|
Course Code: $ Program Elective Lab-I MTCE-125 Course Name: Algorithm Analysis and Design |
||
| MODULE NO / UNIT | COURSE SYLLABUS CONTENTS OF MODULE | NOTES |
|---|---|---|
| 1 | Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal’s algorithm | |
| 2 | Find Minimum Cost Spanning Tree of a given undirected graph using Prim’s algorithm. | |
| 3 | Implement All-Pairs Shortest Paths Problem using Floyd's algorithm. Parallelize this algorithm, implement it using Open and determine the speed-up achieved. | |
| 4 | Implement 0/1 Knapsack Problem using Dynamic Programming | |
| 5 | Print all the nodes reachable from a given starting node in a digraph using BFS method. | |
| 6 | Implement Huffman code using Greedy approach. | |
| 7 | Implement Naïve String matching technique to match the string. | |
| 8 | Implement N Queen's problem using Back Tracking. | |
| 9 | From a given vertex in a weighted connected graph, find shortest paths to other vertices using Dijkstra’s algorithm. | |
| 10 | Implement longest common subsequence. | |
