Module NameDownload

Sl.No Chapter Name English
1Lecture 01 : Insertion Sort and Asymptotic AnalysisPDF unavailable
2Lecture 02: Solving RecurrencesPDF unavailable
3Lecture 03: Divide and Conquer ParadigmPDF unavailable
4Lecture 04: Quick SortPDF unavailable
5Lecture 05 : Heap SortPDF unavailable
6Lecture 06: Decision TreePDF unavailable
7Lecture 07: Linear Time SortingPDF unavailable
8Lecture 08: Order StatisticsPDF unavailable
9Lecture 09: HashingPDF unavailable
10Lecture 10: Universal Hashing, BST SortPDF unavailable
11Lecture 11: Red-Black TreePDF unavailable
12Lecture 12: Augmenting Data StructurePDF unavailable
13Lecture13: Computational GeometryPDF unavailable
14Lecture 14: Van Emde Boas Data StructurePDF unavailable
15Lecture 15: Dynamic ProgrammingPDF unavailable
16Lecture 16 : Graph AlgorithmPDF unavailable
17Lecture 17 : BFS and DFSPDF unavailable
18Lecture 18 : DijkstraPDF unavailable
19Lecture 19 : Bellman FordPDF unavailable
20Lecture 20 : Floyd MarshallPDF unavailable


Sl.No Language Book link
1EnglishNot Available
2BengaliNot Available
3GujaratiNot Available
4HindiNot Available
5KannadaNot Available
6MalayalamNot Available
7MarathiNot Available
8TamilNot Available
9TeluguNot Available