Module NameDownload
noc16-cs24_Week_01_Assignment_01noc16-cs24_Week_01_Assignment_01
noc16-cs24_Week_02_Assignment_01noc16-cs24_Week_02_Assignment_01
noc16-cs24_Week_03_Assignment_01noc16-cs24_Week_03_Assignment_01
noc16-cs24_Week_04_Assignment_01noc16-cs24_Week_04_Assignment_01

Sl.No Chapter Name English
1Lecture 01 : Insertion Sort and Asymptotic AnalysisDownload
To be verified
2Lecture 02: Solving RecurrencesDownload
To be verified
3Lecture 03: Divide and Conquer ParadigmDownload
To be verified
4Lecture 04: Quick SortDownload
To be verified
5Lecture 05 : Heap SortDownload
To be verified
6Lecture 06: Decision TreeDownload
To be verified
7Lecture 07: Linear Time SortingDownload
To be verified
8Lecture 08: Order StatisticsDownload
To be verified
9Lecture 09: HashingDownload
To be verified
10Lecture 10: Universal Hashing, BST SortDownload
To be verified
11Lecture 11: Red-Black TreeDownload
To be verified
12Lecture 12: Augmenting Data StructureDownload
To be verified
13Lecture13: Computational GeometryDownload
To be verified
14Lecture 14: Van Emde Boas Data StructureDownload
To be verified
15Lecture 15: Dynamic ProgrammingDownload
To be verified
16Lecture 16 : Graph AlgorithmDownload
To be verified
17Lecture 17 : BFS and DFSDownload
To be verified
18Lecture 18 : DijkstraDownload
To be verified
19Lecture 19 : Bellman FordDownload
To be verified
20Lecture 20 : Floyd MarshallDownload
To be verified


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