Modules / Lectures


New Assignments
Module NameDownload
noc20-cs27_Week_01_Assignment_01noc20-cs27_Week_01_Assignment_01
noc20-cs27_Week_02_Assignment_01noc20-cs27_Week_02_Assignment_01
noc20-cs27_Week_02_Assignment_02noc20-cs27_Week_02_Assignment_02
noc20-cs27_Week_03_Assignment_01noc20-cs27_Week_03_Assignment_01
noc20-cs27_Week_03_Assignment_02noc20-cs27_Week_03_Assignment_02
noc20-cs27_Week_04_Assignment_01noc20-cs27_Week_04_Assignment_01
noc20-cs27_Week_04_Assignment_02noc20-cs27_Week_04_Assignment_02
noc20-cs27_Week_05_Assignment_01noc20-cs27_Week_05_Assignment_01
noc20-cs27_Week_06_Assignment_01noc20-cs27_Week_06_Assignment_01
noc20-cs27_Week_06_Assignment_02noc20-cs27_Week_06_Assignment_02
noc20-cs27_Week_07_Assignment_01noc20-cs27_Week_07_Assignment_01
noc20-cs27_Week_07_Assignment_02noc20-cs27_Week_07_Assignment_02
noc20-cs27_Week_08_Assignment_01noc20-cs27_Week_08_Assignment_01
Module NameDownloadDescriptionDownload Size
Week 1-Introduction, Analysis of AlgorithmsQuizzQuizz260


Sl.No Chapter Name MP4 Download
1Course OutlineDownload
2Example: Air TravelDownload
3Example: Xerox shopDownload
4Example: Document similarityDownload
5Introduction and motivationDownload
6Input size, worst case, average caseDownload
7Quantifying efficiency: O( ), Omega( ), Theta( )Download
8Examples: Analysis of iterative and recursive algorithmsDownload
9Arrays and listsDownload
10Searching in an arrayDownload
11Selection SortDownload
12Insertion sortDownload
13Merge sortDownload
14Merge sort - analysisDownload
15QuicksortDownload
16Quicksort - analysisDownload
17Sorting - Concluding remarksDownload
18Introduction to graphsDownload
19Representing graphsDownload
20Breadth first search (BFS)Download
21Depth first search (DFS)Download
22Applications of BFS and DFSDownload
23Directed acylic graphs: topological sortDownload
24Directed acylic graphs: longest pathsDownload
25Single source shortest paths: Dijkstras algorithm Download
26Dijkstras algorithm: analysisDownload
27Negative edge weights: Bellman-Ford algorithmDownload
28All pairs shortest pathsDownload
29Minimum Cost Spanning Trees Download
30Prims AlgorithmDownload
31Kruskals algorithmDownload
32Union-Find using arraysDownload
33Union-Find using pointersDownload
34Priority queuesDownload
35HeapsDownload
36Heaps: Updating values, sortingDownload
37Counting inversionsDownload
38Closest pair of pointsDownload
39Binary Search TreesDownload
40Balanced search treesDownload
41Interval schedulingDownload
42Scheduling with deadlines: minimizing latenessDownload
43Huffman codesDownload
44Introduction to dynamic programmingDownload
45MemoizationDownload
46Grid PathsDownload
47Common subwords and subsequencesDownload
48Edit distanceDownload
49Matrix multiplicationDownload
50Linear ProgrammingDownload
51LP modelling: Production PlanningDownload
52LP modelling: Bandwidth allocationDownload
53Network FlowsDownload
54ReductionsDownload
55Checking AlgorithmsDownload
56P and NPDownload

Sl.No Chapter Name English
1Course OutlineDownload
Verified
2Example: Air TravelDownload
Verified
3Example: Xerox shopDownload
Verified
4Example: Document similarityDownload
Verified
5Introduction and motivationDownload
Verified
6Input size, worst case, average caseDownload
Verified
7Quantifying efficiency: O( ), Omega( ), Theta( )Download
Verified
8Examples: Analysis of iterative and recursive algorithmsDownload
Verified
9Arrays and listsDownload
Verified
10Searching in an arrayDownload
Verified
11Selection SortDownload
Verified
12Insertion sortDownload
Verified
13Merge sortDownload
Verified
14Merge sort - analysisDownload
Verified
15QuicksortDownload
Verified
16Quicksort - analysisDownload
Verified
17Sorting - Concluding remarksDownload
Verified
18Introduction to graphsDownload
Verified
19Representing graphsDownload
Verified
20Breadth first search (BFS)Download
Verified
21Depth first search (DFS)Download
Verified
22Applications of BFS and DFSDownload
Verified
23Directed acylic graphs: topological sortDownload
Verified
24Directed acylic graphs: longest pathsDownload
Verified
25Single source shortest paths: Dijkstras algorithm Download
Verified
26Dijkstras algorithm: analysisDownload
Verified
27Negative edge weights: Bellman-Ford algorithmDownload
Verified
28All pairs shortest pathsDownload
Verified
29Minimum Cost Spanning Trees Download
Verified
30Prims AlgorithmDownload
Verified
31Kruskals algorithmDownload
Verified
32Union-Find using arraysDownload
Verified
33Union-Find using pointersDownload
Verified
34Priority queuesDownload
Verified
35HeapsDownload
Verified
36Heaps: Updating values, sortingDownload
Verified
37Counting inversionsDownload
Verified
38Closest pair of pointsDownload
Verified
39Binary Search TreesDownload
Verified
40Balanced search treesDownload
Verified
41Interval schedulingDownload
Verified
42Scheduling with deadlines: minimizing latenessDownload
Verified
43Huffman codesDownload
Verified
44Introduction to dynamic programmingDownload
Verified
45MemoizationDownload
Verified
46Grid PathsDownload
Verified
47Common subwords and subsequencesDownload
Verified
48Edit distanceDownload
Verified
49Matrix multiplicationDownload
Verified
50Linear ProgrammingDownload
Verified
51LP modelling: Production PlanningDownload
Verified
52LP modelling: Bandwidth allocationDownload
Verified
53Network FlowsDownload
Verified
54ReductionsDownload
Verified
55Checking AlgorithmsDownload
Verified
56P and NPDownload
Verified
Sl.No Chapter Name Bengali
1Course OutlineDownload
2Example: Air TravelDownload
3Example: Xerox shopDownload
4Example: Document similarityDownload
5Introduction and motivationDownload
6Input size, worst case, average caseDownload
7Quantifying efficiency: O( ), Omega( ), Theta( )Download
8Examples: Analysis of iterative and recursive algorithmsDownload
9Arrays and listsDownload
10Searching in an arrayDownload
11Selection SortDownload
12Insertion sortDownload
13Merge sortDownload
14Merge sort - analysisDownload
15QuicksortDownload
16Quicksort - analysisDownload
17Sorting - Concluding remarksDownload
18Introduction to graphsDownload
19Representing graphsDownload
20Breadth first search (BFS)Download
21Depth first search (DFS)Download
22Applications of BFS and DFSDownload
23Directed acylic graphs: topological sortDownload
24Directed acylic graphs: longest pathsDownload
25Single source shortest paths: Dijkstras algorithm Download
26Dijkstras algorithm: analysisDownload
27Negative edge weights: Bellman-Ford algorithmDownload
28All pairs shortest pathsDownload
29Minimum Cost Spanning Trees Download
30Prims AlgorithmDownload
31Kruskals algorithmDownload
32Union-Find using arraysDownload
33Union-Find using pointersDownload
34Priority queuesDownload
35HeapsDownload
36Heaps: Updating values, sortingDownload
37Counting inversionsDownload
38Closest pair of pointsDownload
39Binary Search TreesDownload
40Balanced search treesDownload
41Interval schedulingDownload
42Scheduling with deadlines: minimizing latenessDownload
43Huffman codesDownload
44Introduction to dynamic programmingDownload
45MemoizationDownload
46Grid PathsDownload
47Common subwords and subsequencesDownload
48Edit distanceDownload
49Matrix multiplicationDownload
50Linear ProgrammingDownload
51LP modelling: Production PlanningDownload
52LP modelling: Bandwidth allocationDownload
53Network FlowsDownload
54ReductionsDownload
55Checking AlgorithmsDownload
56P and NPDownload
Sl.No Chapter Name Gujarati
1Course OutlineDownload
2Example: Air TravelDownload
3Example: Xerox shopDownload
4Example: Document similarityDownload
5Introduction and motivationDownload
6Input size, worst case, average caseDownload
7Quantifying efficiency: O( ), Omega( ), Theta( )Download
8Examples: Analysis of iterative and recursive algorithmsDownload
9Arrays and listsDownload
10Searching in an arrayDownload
11Selection SortDownload
12Insertion sortDownload
13Merge sortDownload
14Merge sort - analysisDownload
15QuicksortDownload
16Quicksort - analysisDownload
17Sorting - Concluding remarksDownload
18Introduction to graphsDownload
19Representing graphsDownload
20Breadth first search (BFS)Download
21Depth first search (DFS)Download
22Applications of BFS and DFSDownload
23Directed acylic graphs: topological sortDownload
24Directed acylic graphs: longest pathsDownload
25Single source shortest paths: Dijkstras algorithm Download
26Dijkstras algorithm: analysisDownload
27Negative edge weights: Bellman-Ford algorithmDownload
28All pairs shortest pathsDownload
29Minimum Cost Spanning Trees Download
30Prims AlgorithmDownload
31Kruskals algorithmDownload
32Union-Find using arraysDownload
33Union-Find using pointersDownload
34Priority queuesDownload
35HeapsDownload
36Heaps: Updating values, sortingDownload
37Counting inversionsDownload
38Closest pair of pointsDownload
39Binary Search TreesDownload
40Balanced search treesDownload
41Interval schedulingDownload
42Scheduling with deadlines: minimizing latenessDownload
43Huffman codesDownload
44Introduction to dynamic programmingDownload
45MemoizationDownload
46Grid PathsDownload
47Common subwords and subsequencesDownload
48Edit distanceDownload
49Matrix multiplicationDownload
50Linear ProgrammingDownload
51LP modelling: Production PlanningDownload
52LP modelling: Bandwidth allocationDownload
53Network FlowsDownload
54ReductionsDownload
55Checking AlgorithmsDownload
56P and NPDownload
Sl.No Chapter Name Hindi
1Course OutlineDownload
2Example: Air TravelDownload
3Example: Xerox shopDownload
4Example: Document similarityDownload
5Introduction and motivationDownload
6Input size, worst case, average caseDownload
7Quantifying efficiency: O( ), Omega( ), Theta( )Download
8Examples: Analysis of iterative and recursive algorithmsDownload
9Arrays and listsDownload
10Searching in an arrayDownload
11Selection SortDownload
12Insertion sortDownload
13Merge sortDownload
14Merge sort - analysisDownload
15QuicksortDownload
16Quicksort - analysisDownload
17Sorting - Concluding remarksDownload
18Introduction to graphsDownload
19Representing graphsDownload
20Breadth first search (BFS)Download
21Depth first search (DFS)Download
22Applications of BFS and DFSDownload
23Directed acylic graphs: topological sortDownload
24Directed acylic graphs: longest pathsDownload
25Single source shortest paths: Dijkstras algorithm Download
26Dijkstras algorithm: analysisDownload
27Negative edge weights: Bellman-Ford algorithmDownload
28All pairs shortest pathsDownload
29Minimum Cost Spanning Trees Download
30Prims AlgorithmDownload
31Kruskals algorithmDownload
32Union-Find using arraysDownload
33Union-Find using pointersDownload
34Priority queuesDownload
35HeapsDownload
36Heaps: Updating values, sortingDownload
37Counting inversionsDownload
38Closest pair of pointsDownload
39Binary Search TreesDownload
40Balanced search treesDownload
41Interval schedulingDownload
42Scheduling with deadlines: minimizing latenessDownload
43Huffman codesDownload
44Introduction to dynamic programmingDownload
45MemoizationDownload
46Grid PathsDownload
47Common subwords and subsequencesDownload
48Edit distanceDownload
49Matrix multiplicationDownload
50Linear ProgrammingDownload
51LP modelling: Production PlanningDownload
52LP modelling: Bandwidth allocationDownload
53Network FlowsDownload
54ReductionsDownload
55Checking AlgorithmsDownload
56P and NPDownload
Sl.No Chapter Name Telugu
1Course OutlineDownload
2Example: Air TravelDownload
3Example: Xerox shopDownload
4Example: Document similarityDownload
5Introduction and motivationDownload
6Input size, worst case, average caseDownload
7Quantifying efficiency: O( ), Omega( ), Theta( )Download
8Examples: Analysis of iterative and recursive algorithmsDownload
9Arrays and listsDownload
10Searching in an arrayDownload
11Selection SortDownload
12Insertion sortDownload
13Merge sortDownload
14Merge sort - analysisDownload
15QuicksortDownload
16Quicksort - analysisDownload
17Sorting - Concluding remarksDownload
18Introduction to graphsDownload
19Representing graphsDownload
20Breadth first search (BFS)Download
21Depth first search (DFS)Download
22Applications of BFS and DFSDownload
23Directed acylic graphs: topological sortDownload
24Directed acylic graphs: longest pathsDownload
25Single source shortest paths: Dijkstras algorithm Download
26Dijkstras algorithm: analysisDownload
27Negative edge weights: Bellman-Ford algorithmDownload
28All pairs shortest pathsDownload
29Minimum Cost Spanning Trees Download
30Prims AlgorithmDownload
31Kruskals algorithmDownload
32Union-Find using arraysDownload
33Union-Find using pointersDownload
34Priority queuesDownload
35HeapsDownload
36Heaps: Updating values, sortingDownload
37Counting inversionsDownload
38Closest pair of pointsDownload
39Binary Search TreesDownload
40Balanced search treesDownload
41Interval schedulingDownload
42Scheduling with deadlines: minimizing latenessDownload
43Huffman codesDownload
44Introduction to dynamic programmingDownload
45MemoizationDownload
46Grid PathsDownload
47Common subwords and subsequencesDownload
48Edit distanceDownload
49Matrix multiplicationDownload
50Linear ProgrammingDownload
51LP modelling: Production PlanningDownload
52LP modelling: Bandwidth allocationDownload
53Network FlowsDownload
54ReductionsDownload
55Checking AlgorithmsDownload
56P and NPDownload


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