Modules / Lectures

Video Transcript:

Auto Scroll Hide
NameDownloadDownload Size
Lecture NoteDownload as zip file42M


New Assignments
Module NameDownload
noc20_cs10_assigment_1noc20_cs10_assigment_1
noc20_cs10_assigment_10noc20_cs10_assigment_10
noc20_cs10_assigment_11noc20_cs10_assigment_11
noc20_cs10_assigment_12noc20_cs10_assigment_12
noc20_cs10_assigment_13noc20_cs10_assigment_13
noc20_cs10_assigment_2noc20_cs10_assigment_2
noc20_cs10_assigment_3noc20_cs10_assigment_3
noc20_cs10_assigment_4noc20_cs10_assigment_4
noc20_cs10_assigment_5noc20_cs10_assigment_5
noc20_cs10_assigment_6noc20_cs10_assigment_6
noc20_cs10_assigment_7noc20_cs10_assigment_7
noc20_cs10_assigment_8noc20_cs10_assigment_8
noc20_cs10_assigment_9noc20_cs10_assigment_9


Sl.No Chapter Name MP4 Download
1Lecture 1 : Insertion sortDownload
2Lecture 2 : Analysis of Insertion SortDownload
3Lecture 3 : Asymptotic AnalysisDownload
4Lecture 4 : Recurrence of Merge SortDownload
5Lecture 5 : Substitution MethodDownload
6Lecture 6 : The Master MethodDownload
7Lecture 7 : Divide-and-ConquerDownload
8Lecture 8 : Divide-and-Conquer (Contd.)Download
9Lecture 9 : Straseen's AlgorithmsDownload
10Lecture 10 : QuickSortDownload
11Lecture 11 : Analysis of Quicksort.Download
12Lecture 12 : Randomized QuicksortDownload
13Lecture 13 : HeapDownload
14Lecture 14 : Heap SortDownload
15Lecture 15 : Decision TreeDownload
16Lecture 16 : Linear time SortingDownload
17Lecture 17 : Radix Sort & Bucket SortDownload
18Lecture 18 : Order StatisticsDownload
19Lecture 19 : Randomised Order StatisticsDownload
20Lecture 20 : Worst case linear time order statisticsDownload
21Lecture 21 : Hash FunctionDownload
22Lecture 22 : Open AddressingDownload
23Lecture 23 : Universal HashingDownload
24Lecture 24 : Perfect HashingDownload
25Lecture 25 : Binary Search Tree (BST) SortDownload
26Lecture 26 : Randomly build BSTDownload
27Lecture 27 : Red Black TreeDownload
28Lecture 28 : Red Black Tree (Contd.)Download
29Lecture 29 : Augmentation of data structureDownload
30Lecture 30 : Interval treesDownload
31Lecture 31 : Fixed universe successorDownload
32Lecture 32 : Van Emde Boas data structureDownload
33Lecture 33 : Amortized analysisDownload
34Lecture 34 : Computational GeometryDownload
35Lecture 35 : Computational Geometry (cont....)Download
36Lecture 36 : Dynamic ProgrammingDownload
37Lecture 37 : Longest common subsequenceDownload
38Lecture 38 : GraphsDownload
39Lecture 39 : Prim's AlgorithmsDownload
40Lecture 40 : Graph SearchDownload
41Lecture 41 Download
42Lecture 42 Download
43Lecture 43 Download
44Lecture 44 Download
45Lecture 45 Download
46Lecture 46 Download
47Lecture 47Download
48Lecture 48Download
49Lecture 49Download
50Lecture 50 Download
51Lecture 51: Disjoint set data structureDownload
52Lecture 52: Union-FindDownload
53Lecture 53: Augmented disjoint set data structureDownload
54Lecture 54: Network flowDownload
55Lecture 55 Network Flow (contd...)Download
56Lecture 56 : Network Flow (cont...)Download
57Lecture 57 : More on Dynamic ProgrammingDownload
58Lecture 58 : More on Dynamic Programming (cont...)Download
59Lecture 59 : Computational ComplexityDownload
60Lecture 60 : Computational Complexity (cont...)Download

Sl.No Chapter Name English
1Lecture 1 : Insertion sortDownload
Verified
2Lecture 2 : Analysis of Insertion SortDownload
Verified
3Lecture 3 : Asymptotic AnalysisDownload
Verified
4Lecture 4 : Recurrence of Merge SortDownload
Verified
5Lecture 5 : Substitution MethodDownload
Verified
6Lecture 6 : The Master MethodDownload
Verified
7Lecture 7 : Divide-and-ConquerDownload
Verified
8Lecture 8 : Divide-and-Conquer (Contd.)Download
Verified
9Lecture 9 : Straseen's AlgorithmsDownload
Verified
10Lecture 10 : QuickSortDownload
Verified
11Lecture 11 : Analysis of Quicksort.Download
Verified
12Lecture 12 : Randomized QuicksortDownload
Verified
13Lecture 13 : HeapDownload
Verified
14Lecture 14 : Heap SortDownload
Verified
15Lecture 15 : Decision TreeDownload
Verified
16Lecture 16 : Linear time SortingDownload
Verified
17Lecture 17 : Radix Sort & Bucket SortDownload
Verified
18Lecture 18 : Order StatisticsDownload
Verified
19Lecture 19 : Randomised Order StatisticsDownload
Verified
20Lecture 20 : Worst case linear time order statisticsDownload
Verified
21Lecture 21 : Hash FunctionDownload
Verified
22Lecture 22 : Open AddressingDownload
Verified
23Lecture 23 : Universal HashingDownload
Verified
24Lecture 24 : Perfect HashingDownload
Verified
25Lecture 25 : Binary Search Tree (BST) SortDownload
Verified
26Lecture 26 : Randomly build BSTDownload
Verified
27Lecture 27 : Red Black TreeDownload
Verified
28Lecture 28 : Red Black Tree (Contd.)Download
Verified
29Lecture 29 : Augmentation of data structureDownload
Verified
30Lecture 30 : Interval treesDownload
Verified
31Lecture 31 : Fixed universe successorDownload
Verified
32Lecture 32 : Van Emde Boas data structureDownload
Verified
33Lecture 33 : Amortized analysisDownload
Verified
34Lecture 34 : Computational GeometryDownload
Verified
35Lecture 35 : Computational Geometry (cont....)Download
Verified
36Lecture 36 : Dynamic ProgrammingDownload
Verified
37Lecture 37 : Longest common subsequenceDownload
Verified
38Lecture 38 : GraphsDownload
Verified
39Lecture 39 : Prim's AlgorithmsDownload
Verified
40Lecture 40 : Graph SearchDownload
Verified
41Lecture 41 Download
Verified
42Lecture 42 Download
Verified
43Lecture 43 Download
Verified
44Lecture 44 Download
Verified
45Lecture 45 Download
Verified
46Lecture 46 Download
Verified
47Lecture 47Download
Verified
48Lecture 48Download
Verified
49Lecture 49Download
Verified
50Lecture 50 Download
Verified
51Lecture 51: Disjoint set data structureDownload
Verified
52Lecture 52: Union-FindDownload
Verified
53Lecture 53: Augmented disjoint set data structureDownload
Verified
54Lecture 54: Network flowDownload
Verified
55Lecture 55 Network Flow (contd...)Download
Verified
56Lecture 56 : Network Flow (cont...)Download
Verified
57Lecture 57 : More on Dynamic ProgrammingDownload
Verified
58Lecture 58 : More on Dynamic Programming (cont...)Download
Verified
59Lecture 59 : Computational ComplexityDownload
Verified
60Lecture 60 : Computational Complexity (cont...)Download
Verified


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