Asymptotic notations and their significance, introduction to RAM model of computation, complexity analysis of algorithms, worst case and average case.
Basic introduction to algorithmic paradigms like divide and conquer, recursion, greedy, etc.
Searching: binary search trees, balanced binary search trees, AVL trees and red-black trees, B-trees, skip lists, hashing.
Priority queues, heaps, Interval trees, tries.
Order statistics.
Sorting: comparison based sorting - quick sort, heap sort, merge sort: worst and average case analysis.
Decision tree model and (worst case) lower bound on sorting.
Sorting in linear time - radix sort, bucket sort, counting sort, etc.
String matching.
Graph Algorithms: BFS, DFS, connected components, topological sort, minimum spanning trees, shortest paths - single source and all pairs.
| Date | Topic | Course Materials |
|---|---|---|
| 24 Jul, 2024 | Introduction | 01_Introduction.pptx |
| 25,26 Jul, 2024 | Analysis | 02_Analysis.pptx |
| 31 Jul, 1,2,7,8 Aug, 2024 | Divide and Conquer, Recursion | 03_Recursion_DAC.pptx |
| 14,16,21 Aug, 2024 | Greedy Algorithms | 04_Greedy.pptx |
| 22,23,28 Aug, 2024 | Dynamic Programming | 05_DP.pptx |
| 30 Aug, 4,6 Sep, 2024 | Trees | 06_Trees.pptx |
| 26,27 Sep, 3 Oct, 2024 | Priority Queues and Heaps | 07_Priority_Queues_Heaps.pptx |
| 16,17,18 Oct, 2024 | Hashing | 08_Hashing.pptx |
| Graphs-I Graphs-II |
09_Graphs_I.pptx 09_Graphs_II.pptx |
owais.iqbal@kgpian.iitkgp.ac.in
barmanrahul@kgpian.iitkgp.ac.in
sanimesh005@kgpian.iitkgp.ac.in
mandaldipan@kgpian.iitkgp.ac.in
bsoham58@kgpian.iitkgp.ac.in
vivek.das@kgpian.iitkgp.ac.in
sumitdwivedi49@kgpian.iitkgp.ac.in
rahulram00925@kgpian.iitkgp.ac.in
pranavkulkarni610@kgpian.iitkgp.ac.in
priydarshiroopak@kgpian.iitkgp.ac.in
grace@kgpian.iitkgp.ac.in
