| Module Name | Download |
|---|---|
| noc16-cs24_Week_01_Assignment_01 | noc16-cs24_Week_01_Assignment_01 |
| noc16-cs24_Week_02_Assignment_01 | noc16-cs24_Week_02_Assignment_01 |
| noc16-cs24_Week_03_Assignment_01 | noc16-cs24_Week_03_Assignment_01 |
| noc16-cs24_Week_04_Assignment_01 | noc16-cs24_Week_04_Assignment_01 |
| Sl.No | Chapter Name | MP4 Download |
|---|---|---|
| 1 | Lecture 01 : Insertion Sort and Asymptotic Analysis | Download |
| 2 | Lecture 02: Solving Recurrences | Download |
| 3 | Lecture 03: Divide and Conquer Paradigm | Download |
| 4 | Lecture 04: Quick Sort | Download |
| 5 | Lecture 05 : Heap Sort | Download |
| 6 | Lecture 06: Decision Tree | Download |
| 7 | Lecture 07: Linear Time Sorting | Download |
| 8 | Lecture 08: Order Statistics | Download |
| 9 | Lecture 09: Hashing | Download |
| 10 | Lecture 10: Universal Hashing, BST Sort | Download |
| 11 | Lecture 11: Red-Black Tree | Download |
| 12 | Lecture 12: Augmenting Data Structure | Download |
| 13 | Lecture13: Computational Geometry | Download |
| 14 | Lecture 14: Van Emde Boas Data Structure | Download |
| 15 | Lecture 15: Dynamic Programming | Download |
| 16 | Lecture 16 : Graph Algorithm | Download |
| 17 | Lecture 17 : BFS and DFS | Download |
| 18 | Lecture 18 : Dijkstra | Download |
| 19 | Lecture 19 : Bellman Ford | Download |
| 20 | Lecture 20 : Floyd Marshall | Download |
| Sl.No | Chapter Name | English |
|---|---|---|
| 1 | Lecture 01 : Insertion Sort and Asymptotic Analysis | Download To be verified |
| 2 | Lecture 02: Solving Recurrences | Download To be verified |
| 3 | Lecture 03: Divide and Conquer Paradigm | Download To be verified |
| 4 | Lecture 04: Quick Sort | Download To be verified |
| 5 | Lecture 05 : Heap Sort | Download To be verified |
| 6 | Lecture 06: Decision Tree | Download To be verified |
| 7 | Lecture 07: Linear Time Sorting | Download To be verified |
| 8 | Lecture 08: Order Statistics | Download To be verified |
| 9 | Lecture 09: Hashing | Download To be verified |
| 10 | Lecture 10: Universal Hashing, BST Sort | Download To be verified |
| 11 | Lecture 11: Red-Black Tree | Download To be verified |
| 12 | Lecture 12: Augmenting Data Structure | Download To be verified |
| 13 | Lecture13: Computational Geometry | Download To be verified |
| 14 | Lecture 14: Van Emde Boas Data Structure | Download To be verified |
| 15 | Lecture 15: Dynamic Programming | Download To be verified |
| 16 | Lecture 16 : Graph Algorithm | Download To be verified |
| 17 | Lecture 17 : BFS and DFS | Download To be verified |
| 18 | Lecture 18 : Dijkstra | Download To be verified |
| 19 | Lecture 19 : Bellman Ford | Download To be verified |
| 20 | Lecture 20 : Floyd Marshall | Download To be verified |
| Sl.No | Language | Book link |
|---|---|---|
| 1 | English | Not Available |
| 2 | Bengali | Not Available |
| 3 | Gujarati | Not Available |
| 4 | Hindi | Not Available |
| 5 | Kannada | Not Available |
| 6 | Malayalam | Not Available |
| 7 | Marathi | Not Available |
| 8 | Tamil | Not Available |
| 9 | Telugu | Not Available |