MA60002: Data Structure And Algorithm
| MA60002 | |||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Course name | DATA STRUCTURE AND ALGORITHM | ||||||||||||||||||||||||
| Offered by | Mathematics | ||||||||||||||||||||||||
| Credits | 4 | ||||||||||||||||||||||||
| L-T-P | 3-1-0 | ||||||||||||||||||||||||
| Previous Year Grade Distribution | |||||||||||||||||||||||||
| |||||||||||||||||||||||||
| Semester | {{{semester}}} | ||||||||||||||||||||||||
Syllabus
Syllabus mentioned in ERP
Prerequisite: Programming LanguagesStack and queues, Linked list, Direct address tables, Indexing, hash tables, open addressing, trees, Binary search tree, height balanced tree, Red-black tree, B-tree. Basic concepts of algorithms, Complexity, Asymptotic notations, Trees: Binary tree, Binary Search Tree, Tree traversals. Heap as data structure. Basic sorting algorithms: selection sort, insertion sort. Greedy algorithms: Coin change problem, activity selection, Minimum Spanning Tree, Single source shortest path, knapsack problem. Divide â and â Conquer technique: Merge sort, quick sort. Solving Recurrence relations. Dynamic programming: matrix chain multiplication, all pair shortest path algorithm. Graph algorithms: Warshall s algorithm, Depth First Search, Breadth First Search. Branch and Bound technique, Backtracking. NP completeness.