MTL752
| MTL752 | |
|---|---|
| Data Structures for Applied Mathematics | |
| Credits | 4 |
| Structure | 3-0-2 |
| Pre-requisites | MTL 505 Computer Programming |
| Overlaps | COL 106 (60%), COL 351 (20%), COL 702 |
MTL752 : Data Structures for Applied Mathematics
[edit](30%) Course Contents: Review of some concepts of C-programming languages such as Array, structures, pointers, linked list; Growth rate of Functions: Big Oh, small oh, Big Omega, small omega and theta notations; Data structures: stacks, queues, Binary Search trees, Balanced Binary Trees: AVL trees; Binary Heaps; Data structures for representing graphs: Adjacency matrix and Adjacency lists; Sorting: merge, quick, radix, selection, bucket sort, and heap sort; Graph Algorithms: Breadth first search, Depth first search; Dijkstra's shortest path algorithm, Prim's and Kruskal's MST algorithms; Introduction to Algorithm Design Techniques: Greedy, Divide and Conquer, and Dynamic Programming Technique.