Search Colleges, Exams, Schools & more
Login
Algorithmic Graph Theory and Data Structures
Online
12 Weeks
Free Quick Facts
| Medium Of Instructions | Mode Of Learning | Mode Of Delivery |
|---|---|---|
| English | Self Study |
Courses and Certificate Fees
| Fees Informations | Certificate Availability | Certificate Providing Authority |
|---|---|---|
| INR 1000 | yes | IIT Kharagpur |
The Syllabus
- Introduction to Algorithms, Analysis of Algorithm, Time Complexity, Merge Sort, Solving the Recurrences.
- Solving the Recurrences, Divide and Conquer Algorithms, Fibonacci numbers and Matrix Multiplication, Quicksort, Randomized Quicksort
- Heapsort, Linear Time Sorting, Order Statistics.
- Hash Function, Open Addressing Hashing, Universal Hash Functions, Perfect Hashing, Heap.
- Binary Search Tree, Binary Search Tree Sort, Randomly Build Binary Search Tree, Balanced Build Binary Search Tree, Red Black Tree.
- Data-structure Augmentation, Interval Trees, Fixed Universe Successor, Van Emde Boas, Computational Geometry.
- Orthogonal Range Tree, Amortized Analysis, Disjoint Set.
- Dynamic Programming, Introduction to Graphs, Minimum Spanning Tree, Prim’s Algorithm, Kruskal Algorithm.
- Graph Search Algorithm, Depth First Search (DFS), Application of DFS, Breadth First Search (BFS), Shortest Path Algorithm
- Dijkstra’s Algorithm, Bellman-Ford, Application of Bellman-Ford, Johnson’s Algorithm.
- All Pairs Shortest Path, Floyd-Warshall, Flow Network, Ford-Fulkerson Max Flow.
- Max Flow Min Cut Theorem, Ford-Fulkerson Max Flow Algorithm, Edmond-Karp Algorithm, Computational Complexity.