| Name | Download | Download Size |
|---|---|---|
| Lecture Note | Download as zip file | 42M |
| Module Name | Download |
|---|---|
| noc20_cs10_assigment_1 | noc20_cs10_assigment_1 |
| noc20_cs10_assigment_10 | noc20_cs10_assigment_10 |
| noc20_cs10_assigment_11 | noc20_cs10_assigment_11 |
| noc20_cs10_assigment_12 | noc20_cs10_assigment_12 |
| noc20_cs10_assigment_13 | noc20_cs10_assigment_13 |
| noc20_cs10_assigment_2 | noc20_cs10_assigment_2 |
| noc20_cs10_assigment_3 | noc20_cs10_assigment_3 |
| noc20_cs10_assigment_4 | noc20_cs10_assigment_4 |
| noc20_cs10_assigment_5 | noc20_cs10_assigment_5 |
| noc20_cs10_assigment_6 | noc20_cs10_assigment_6 |
| noc20_cs10_assigment_7 | noc20_cs10_assigment_7 |
| noc20_cs10_assigment_8 | noc20_cs10_assigment_8 |
| noc20_cs10_assigment_9 | noc20_cs10_assigment_9 |
| Sl.No | Chapter Name | MP4 Download |
|---|---|---|
| 1 | Lecture 1 : Insertion sort | Download |
| 2 | Lecture 2 : Analysis of Insertion Sort | Download |
| 3 | Lecture 3 : Asymptotic Analysis | Download |
| 4 | Lecture 4 : Recurrence of Merge Sort | Download |
| 5 | Lecture 5 : Substitution Method | Download |
| 6 | Lecture 6 : The Master Method | Download |
| 7 | Lecture 7 : Divide-and-Conquer | Download |
| 8 | Lecture 8 : Divide-and-Conquer (Contd.) | Download |
| 9 | Lecture 9 : Straseen's Algorithms | Download |
| 10 | Lecture 10 : QuickSort | Download |
| 11 | Lecture 11 : Analysis of Quicksort. | Download |
| 12 | Lecture 12 : Randomized Quicksort | Download |
| 13 | Lecture 13 : Heap | Download |
| 14 | Lecture 14 : Heap Sort | Download |
| 15 | Lecture 15 : Decision Tree | Download |
| 16 | Lecture 16 : Linear time Sorting | Download |
| 17 | Lecture 17 : Radix Sort & Bucket Sort | Download |
| 18 | Lecture 18 : Order Statistics | Download |
| 19 | Lecture 19 : Randomised Order Statistics | Download |
| 20 | Lecture 20 : Worst case linear time order statistics | Download |
| 21 | Lecture 21 : Hash Function | Download |
| 22 | Lecture 22 : Open Addressing | Download |
| 23 | Lecture 23 : Universal Hashing | Download |
| 24 | Lecture 24 : Perfect Hashing | Download |
| 25 | Lecture 25 : Binary Search Tree (BST) Sort | Download |
| 26 | Lecture 26 : Randomly build BST | Download |
| 27 | Lecture 27 : Red Black Tree | Download |
| 28 | Lecture 28 : Red Black Tree (Contd.) | Download |
| 29 | Lecture 29 : Augmentation of data structure | Download |
| 30 | Lecture 30 : Interval trees | Download |
| 31 | Lecture 31 : Fixed universe successor | Download |
| 32 | Lecture 32 : Van Emde Boas data structure | Download |
| 33 | Lecture 33 : Amortized analysis | Download |
| 34 | Lecture 34 : Computational Geometry | Download |
| 35 | Lecture 35 : Computational Geometry (cont....) | Download |
| 36 | Lecture 36 : Dynamic Programming | Download |
| 37 | Lecture 37 : Longest common subsequence | Download |
| 38 | Lecture 38 : Graphs | Download |
| 39 | Lecture 39 : Prim's Algorithms | Download |
| 40 | Lecture 40 : Graph Search | Download |
| 41 | Lecture 41 | Download |
| 42 | Lecture 42 | Download |
| 43 | Lecture 43 | Download |
| 44 | Lecture 44 | Download |
| 45 | Lecture 45 | Download |
| 46 | Lecture 46 | Download |
| 47 | Lecture 47 | Download |
| 48 | Lecture 48 | Download |
| 49 | Lecture 49 | Download |
| 50 | Lecture 50 | Download |
| 51 | Lecture 51: Disjoint set data structure | Download |
| 52 | Lecture 52: Union-Find | Download |
| 53 | Lecture 53: Augmented disjoint set data structure | Download |
| 54 | Lecture 54: Network flow | Download |
| 55 | Lecture 55 Network Flow (contd...) | Download |
| 56 | Lecture 56 : Network Flow (cont...) | Download |
| 57 | Lecture 57 : More on Dynamic Programming | Download |
| 58 | Lecture 58 : More on Dynamic Programming (cont...) | Download |
| 59 | Lecture 59 : Computational Complexity | Download |
| 60 | Lecture 60 : Computational Complexity (cont...) | Download |
| Sl.No | Chapter Name | English |
|---|---|---|
| 1 | Lecture 1 : Insertion sort | Download Verified |
| 2 | Lecture 2 : Analysis of Insertion Sort | Download Verified |
| 3 | Lecture 3 : Asymptotic Analysis | Download Verified |
| 4 | Lecture 4 : Recurrence of Merge Sort | Download Verified |
| 5 | Lecture 5 : Substitution Method | Download Verified |
| 6 | Lecture 6 : The Master Method | Download Verified |
| 7 | Lecture 7 : Divide-and-Conquer | Download Verified |
| 8 | Lecture 8 : Divide-and-Conquer (Contd.) | Download Verified |
| 9 | Lecture 9 : Straseen's Algorithms | Download Verified |
| 10 | Lecture 10 : QuickSort | Download Verified |
| 11 | Lecture 11 : Analysis of Quicksort. | Download Verified |
| 12 | Lecture 12 : Randomized Quicksort | Download Verified |
| 13 | Lecture 13 : Heap | Download Verified |
| 14 | Lecture 14 : Heap Sort | Download Verified |
| 15 | Lecture 15 : Decision Tree | Download Verified |
| 16 | Lecture 16 : Linear time Sorting | Download Verified |
| 17 | Lecture 17 : Radix Sort & Bucket Sort | Download Verified |
| 18 | Lecture 18 : Order Statistics | Download Verified |
| 19 | Lecture 19 : Randomised Order Statistics | Download Verified |
| 20 | Lecture 20 : Worst case linear time order statistics | Download Verified |
| 21 | Lecture 21 : Hash Function | Download Verified |
| 22 | Lecture 22 : Open Addressing | Download Verified |
| 23 | Lecture 23 : Universal Hashing | Download Verified |
| 24 | Lecture 24 : Perfect Hashing | Download Verified |
| 25 | Lecture 25 : Binary Search Tree (BST) Sort | Download Verified |
| 26 | Lecture 26 : Randomly build BST | Download Verified |
| 27 | Lecture 27 : Red Black Tree | Download Verified |
| 28 | Lecture 28 : Red Black Tree (Contd.) | Download Verified |
| 29 | Lecture 29 : Augmentation of data structure | Download Verified |
| 30 | Lecture 30 : Interval trees | Download Verified |
| 31 | Lecture 31 : Fixed universe successor | Download Verified |
| 32 | Lecture 32 : Van Emde Boas data structure | Download Verified |
| 33 | Lecture 33 : Amortized analysis | Download Verified |
| 34 | Lecture 34 : Computational Geometry | Download Verified |
| 35 | Lecture 35 : Computational Geometry (cont....) | Download Verified |
| 36 | Lecture 36 : Dynamic Programming | Download Verified |
| 37 | Lecture 37 : Longest common subsequence | Download Verified |
| 38 | Lecture 38 : Graphs | Download Verified |
| 39 | Lecture 39 : Prim's Algorithms | Download Verified |
| 40 | Lecture 40 : Graph Search | Download Verified |
| 41 | Lecture 41 | Download Verified |
| 42 | Lecture 42 | Download Verified |
| 43 | Lecture 43 | Download Verified |
| 44 | Lecture 44 | Download Verified |
| 45 | Lecture 45 | Download Verified |
| 46 | Lecture 46 | Download Verified |
| 47 | Lecture 47 | Download Verified |
| 48 | Lecture 48 | Download Verified |
| 49 | Lecture 49 | Download Verified |
| 50 | Lecture 50 | Download Verified |
| 51 | Lecture 51: Disjoint set data structure | Download Verified |
| 52 | Lecture 52: Union-Find | Download Verified |
| 53 | Lecture 53: Augmented disjoint set data structure | Download Verified |
| 54 | Lecture 54: Network flow | Download Verified |
| 55 | Lecture 55 Network Flow (contd...) | Download Verified |
| 56 | Lecture 56 : Network Flow (cont...) | Download Verified |
| 57 | Lecture 57 : More on Dynamic Programming | Download Verified |
| 58 | Lecture 58 : More on Dynamic Programming (cont...) | Download Verified |
| 59 | Lecture 59 : Computational Complexity | Download Verified |
| 60 | Lecture 60 : Computational Complexity (cont...) | Download Verified |
| Sl.No | Language | Book link |
|---|---|---|
| 1 | English | Download |
| 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 |