| Module Name | Download |
|---|---|
| noc20-cs27_Week_01_Assignment_01 | noc20-cs27_Week_01_Assignment_01 |
| noc20-cs27_Week_02_Assignment_01 | noc20-cs27_Week_02_Assignment_01 |
| noc20-cs27_Week_02_Assignment_02 | noc20-cs27_Week_02_Assignment_02 |
| noc20-cs27_Week_03_Assignment_01 | noc20-cs27_Week_03_Assignment_01 |
| noc20-cs27_Week_03_Assignment_02 | noc20-cs27_Week_03_Assignment_02 |
| noc20-cs27_Week_04_Assignment_01 | noc20-cs27_Week_04_Assignment_01 |
| noc20-cs27_Week_04_Assignment_02 | noc20-cs27_Week_04_Assignment_02 |
| noc20-cs27_Week_05_Assignment_01 | noc20-cs27_Week_05_Assignment_01 |
| noc20-cs27_Week_06_Assignment_01 | noc20-cs27_Week_06_Assignment_01 |
| noc20-cs27_Week_06_Assignment_02 | noc20-cs27_Week_06_Assignment_02 |
| noc20-cs27_Week_07_Assignment_01 | noc20-cs27_Week_07_Assignment_01 |
| noc20-cs27_Week_07_Assignment_02 | noc20-cs27_Week_07_Assignment_02 |
| noc20-cs27_Week_08_Assignment_01 | noc20-cs27_Week_08_Assignment_01 |
| Module Name | Download | Description | Download Size |
|---|---|---|---|
| Week 1-Introduction, Analysis of Algorithms | Quizz | Quizz | 260 |
| Sl.No | Chapter Name | MP4 Download |
|---|---|---|
| 1 | Course Outline | Download |
| 2 | Example: Air Travel | Download |
| 3 | Example: Xerox shop | Download |
| 4 | Example: Document similarity | Download |
| 5 | Introduction and motivation | Download |
| 6 | Input size, worst case, average case | Download |
| 7 | Quantifying efficiency: O( ), Omega( ), Theta( ) | Download |
| 8 | Examples: Analysis of iterative and recursive algorithms | Download |
| 9 | Arrays and lists | Download |
| 10 | Searching in an array | Download |
| 11 | Selection Sort | Download |
| 12 | Insertion sort | Download |
| 13 | Merge sort | Download |
| 14 | Merge sort - analysis | Download |
| 15 | Quicksort | Download |
| 16 | Quicksort - analysis | Download |
| 17 | Sorting - Concluding remarks | Download |
| 18 | Introduction to graphs | Download |
| 19 | Representing graphs | Download |
| 20 | Breadth first search (BFS) | Download |
| 21 | Depth first search (DFS) | Download |
| 22 | Applications of BFS and DFS | Download |
| 23 | Directed acylic graphs: topological sort | Download |
| 24 | Directed acylic graphs: longest paths | Download |
| 25 | Single source shortest paths: Dijkstras algorithm | Download |
| 26 | Dijkstras algorithm: analysis | Download |
| 27 | Negative edge weights: Bellman-Ford algorithm | Download |
| 28 | All pairs shortest paths | Download |
| 29 | Minimum Cost Spanning Trees | Download |
| 30 | Prims Algorithm | Download |
| 31 | Kruskals algorithm | Download |
| 32 | Union-Find using arrays | Download |
| 33 | Union-Find using pointers | Download |
| 34 | Priority queues | Download |
| 35 | Heaps | Download |
| 36 | Heaps: Updating values, sorting | Download |
| 37 | Counting inversions | Download |
| 38 | Closest pair of points | Download |
| 39 | Binary Search Trees | Download |
| 40 | Balanced search trees | Download |
| 41 | Interval scheduling | Download |
| 42 | Scheduling with deadlines: minimizing lateness | Download |
| 43 | Huffman codes | Download |
| 44 | Introduction to dynamic programming | Download |
| 45 | Memoization | Download |
| 46 | Grid Paths | Download |
| 47 | Common subwords and subsequences | Download |
| 48 | Edit distance | Download |
| 49 | Matrix multiplication | Download |
| 50 | Linear Programming | Download |
| 51 | LP modelling: Production Planning | Download |
| 52 | LP modelling: Bandwidth allocation | Download |
| 53 | Network Flows | Download |
| 54 | Reductions | Download |
| 55 | Checking Algorithms | Download |
| 56 | P and NP | Download |
| Sl.No | Chapter Name | English |
|---|---|---|
| 1 | Course Outline | Download Verified |
| 2 | Example: Air Travel | Download Verified |
| 3 | Example: Xerox shop | Download Verified |
| 4 | Example: Document similarity | Download Verified |
| 5 | Introduction and motivation | Download Verified |
| 6 | Input size, worst case, average case | Download Verified |
| 7 | Quantifying efficiency: O( ), Omega( ), Theta( ) | Download Verified |
| 8 | Examples: Analysis of iterative and recursive algorithms | Download Verified |
| 9 | Arrays and lists | Download Verified |
| 10 | Searching in an array | Download Verified |
| 11 | Selection Sort | Download Verified |
| 12 | Insertion sort | Download Verified |
| 13 | Merge sort | Download Verified |
| 14 | Merge sort - analysis | Download Verified |
| 15 | Quicksort | Download Verified |
| 16 | Quicksort - analysis | Download Verified |
| 17 | Sorting - Concluding remarks | Download Verified |
| 18 | Introduction to graphs | Download Verified |
| 19 | Representing graphs | Download Verified |
| 20 | Breadth first search (BFS) | Download Verified |
| 21 | Depth first search (DFS) | Download Verified |
| 22 | Applications of BFS and DFS | Download Verified |
| 23 | Directed acylic graphs: topological sort | Download Verified |
| 24 | Directed acylic graphs: longest paths | Download Verified |
| 25 | Single source shortest paths: Dijkstras algorithm | Download Verified |
| 26 | Dijkstras algorithm: analysis | Download Verified |
| 27 | Negative edge weights: Bellman-Ford algorithm | Download Verified |
| 28 | All pairs shortest paths | Download Verified |
| 29 | Minimum Cost Spanning Trees | Download Verified |
| 30 | Prims Algorithm | Download Verified |
| 31 | Kruskals algorithm | Download Verified |
| 32 | Union-Find using arrays | Download Verified |
| 33 | Union-Find using pointers | Download Verified |
| 34 | Priority queues | Download Verified |
| 35 | Heaps | Download Verified |
| 36 | Heaps: Updating values, sorting | Download Verified |
| 37 | Counting inversions | Download Verified |
| 38 | Closest pair of points | Download Verified |
| 39 | Binary Search Trees | Download Verified |
| 40 | Balanced search trees | Download Verified |
| 41 | Interval scheduling | Download Verified |
| 42 | Scheduling with deadlines: minimizing lateness | Download Verified |
| 43 | Huffman codes | Download Verified |
| 44 | Introduction to dynamic programming | Download Verified |
| 45 | Memoization | Download Verified |
| 46 | Grid Paths | Download Verified |
| 47 | Common subwords and subsequences | Download Verified |
| 48 | Edit distance | Download Verified |
| 49 | Matrix multiplication | Download Verified |
| 50 | Linear Programming | Download Verified |
| 51 | LP modelling: Production Planning | Download Verified |
| 52 | LP modelling: Bandwidth allocation | Download Verified |
| 53 | Network Flows | Download Verified |
| 54 | Reductions | Download Verified |
| 55 | Checking Algorithms | Download Verified |
| 56 | P and NP | Download Verified |
| Sl.No | Chapter Name | Bengali |
|---|---|---|
| 1 | Course Outline | Download |
| 2 | Example: Air Travel | Download |
| 3 | Example: Xerox shop | Download |
| 4 | Example: Document similarity | Download |
| 5 | Introduction and motivation | Download |
| 6 | Input size, worst case, average case | Download |
| 7 | Quantifying efficiency: O( ), Omega( ), Theta( ) | Download |
| 8 | Examples: Analysis of iterative and recursive algorithms | Download |
| 9 | Arrays and lists | Download |
| 10 | Searching in an array | Download |
| 11 | Selection Sort | Download |
| 12 | Insertion sort | Download |
| 13 | Merge sort | Download |
| 14 | Merge sort - analysis | Download |
| 15 | Quicksort | Download |
| 16 | Quicksort - analysis | Download |
| 17 | Sorting - Concluding remarks | Download |
| 18 | Introduction to graphs | Download |
| 19 | Representing graphs | Download |
| 20 | Breadth first search (BFS) | Download |
| 21 | Depth first search (DFS) | Download |
| 22 | Applications of BFS and DFS | Download |
| 23 | Directed acylic graphs: topological sort | Download |
| 24 | Directed acylic graphs: longest paths | Download |
| 25 | Single source shortest paths: Dijkstras algorithm | Download |
| 26 | Dijkstras algorithm: analysis | Download |
| 27 | Negative edge weights: Bellman-Ford algorithm | Download |
| 28 | All pairs shortest paths | Download |
| 29 | Minimum Cost Spanning Trees | Download |
| 30 | Prims Algorithm | Download |
| 31 | Kruskals algorithm | Download |
| 32 | Union-Find using arrays | Download |
| 33 | Union-Find using pointers | Download |
| 34 | Priority queues | Download |
| 35 | Heaps | Download |
| 36 | Heaps: Updating values, sorting | Download |
| 37 | Counting inversions | Download |
| 38 | Closest pair of points | Download |
| 39 | Binary Search Trees | Download |
| 40 | Balanced search trees | Download |
| 41 | Interval scheduling | Download |
| 42 | Scheduling with deadlines: minimizing lateness | Download |
| 43 | Huffman codes | Download |
| 44 | Introduction to dynamic programming | Download |
| 45 | Memoization | Download |
| 46 | Grid Paths | Download |
| 47 | Common subwords and subsequences | Download |
| 48 | Edit distance | Download |
| 49 | Matrix multiplication | Download |
| 50 | Linear Programming | Download |
| 51 | LP modelling: Production Planning | Download |
| 52 | LP modelling: Bandwidth allocation | Download |
| 53 | Network Flows | Download |
| 54 | Reductions | Download |
| 55 | Checking Algorithms | Download |
| 56 | P and NP | Download |
| Sl.No | Chapter Name | Gujarati |
|---|---|---|
| 1 | Course Outline | Download |
| 2 | Example: Air Travel | Download |
| 3 | Example: Xerox shop | Download |
| 4 | Example: Document similarity | Download |
| 5 | Introduction and motivation | Download |
| 6 | Input size, worst case, average case | Download |
| 7 | Quantifying efficiency: O( ), Omega( ), Theta( ) | Download |
| 8 | Examples: Analysis of iterative and recursive algorithms | Download |
| 9 | Arrays and lists | Download |
| 10 | Searching in an array | Download |
| 11 | Selection Sort | Download |
| 12 | Insertion sort | Download |
| 13 | Merge sort | Download |
| 14 | Merge sort - analysis | Download |
| 15 | Quicksort | Download |
| 16 | Quicksort - analysis | Download |
| 17 | Sorting - Concluding remarks | Download |
| 18 | Introduction to graphs | Download |
| 19 | Representing graphs | Download |
| 20 | Breadth first search (BFS) | Download |
| 21 | Depth first search (DFS) | Download |
| 22 | Applications of BFS and DFS | Download |
| 23 | Directed acylic graphs: topological sort | Download |
| 24 | Directed acylic graphs: longest paths | Download |
| 25 | Single source shortest paths: Dijkstras algorithm | Download |
| 26 | Dijkstras algorithm: analysis | Download |
| 27 | Negative edge weights: Bellman-Ford algorithm | Download |
| 28 | All pairs shortest paths | Download |
| 29 | Minimum Cost Spanning Trees | Download |
| 30 | Prims Algorithm | Download |
| 31 | Kruskals algorithm | Download |
| 32 | Union-Find using arrays | Download |
| 33 | Union-Find using pointers | Download |
| 34 | Priority queues | Download |
| 35 | Heaps | Download |
| 36 | Heaps: Updating values, sorting | Download |
| 37 | Counting inversions | Download |
| 38 | Closest pair of points | Download |
| 39 | Binary Search Trees | Download |
| 40 | Balanced search trees | Download |
| 41 | Interval scheduling | Download |
| 42 | Scheduling with deadlines: minimizing lateness | Download |
| 43 | Huffman codes | Download |
| 44 | Introduction to dynamic programming | Download |
| 45 | Memoization | Download |
| 46 | Grid Paths | Download |
| 47 | Common subwords and subsequences | Download |
| 48 | Edit distance | Download |
| 49 | Matrix multiplication | Download |
| 50 | Linear Programming | Download |
| 51 | LP modelling: Production Planning | Download |
| 52 | LP modelling: Bandwidth allocation | Download |
| 53 | Network Flows | Download |
| 54 | Reductions | Download |
| 55 | Checking Algorithms | Download |
| 56 | P and NP | Download |
| Sl.No | Chapter Name | Hindi |
|---|---|---|
| 1 | Course Outline | Download |
| 2 | Example: Air Travel | Download |
| 3 | Example: Xerox shop | Download |
| 4 | Example: Document similarity | Download |
| 5 | Introduction and motivation | Download |
| 6 | Input size, worst case, average case | Download |
| 7 | Quantifying efficiency: O( ), Omega( ), Theta( ) | Download |
| 8 | Examples: Analysis of iterative and recursive algorithms | Download |
| 9 | Arrays and lists | Download |
| 10 | Searching in an array | Download |
| 11 | Selection Sort | Download |
| 12 | Insertion sort | Download |
| 13 | Merge sort | Download |
| 14 | Merge sort - analysis | Download |
| 15 | Quicksort | Download |
| 16 | Quicksort - analysis | Download |
| 17 | Sorting - Concluding remarks | Download |
| 18 | Introduction to graphs | Download |
| 19 | Representing graphs | Download |
| 20 | Breadth first search (BFS) | Download |
| 21 | Depth first search (DFS) | Download |
| 22 | Applications of BFS and DFS | Download |
| 23 | Directed acylic graphs: topological sort | Download |
| 24 | Directed acylic graphs: longest paths | Download |
| 25 | Single source shortest paths: Dijkstras algorithm | Download |
| 26 | Dijkstras algorithm: analysis | Download |
| 27 | Negative edge weights: Bellman-Ford algorithm | Download |
| 28 | All pairs shortest paths | Download |
| 29 | Minimum Cost Spanning Trees | Download |
| 30 | Prims Algorithm | Download |
| 31 | Kruskals algorithm | Download |
| 32 | Union-Find using arrays | Download |
| 33 | Union-Find using pointers | Download |
| 34 | Priority queues | Download |
| 35 | Heaps | Download |
| 36 | Heaps: Updating values, sorting | Download |
| 37 | Counting inversions | Download |
| 38 | Closest pair of points | Download |
| 39 | Binary Search Trees | Download |
| 40 | Balanced search trees | Download |
| 41 | Interval scheduling | Download |
| 42 | Scheduling with deadlines: minimizing lateness | Download |
| 43 | Huffman codes | Download |
| 44 | Introduction to dynamic programming | Download |
| 45 | Memoization | Download |
| 46 | Grid Paths | Download |
| 47 | Common subwords and subsequences | Download |
| 48 | Edit distance | Download |
| 49 | Matrix multiplication | Download |
| 50 | Linear Programming | Download |
| 51 | LP modelling: Production Planning | Download |
| 52 | LP modelling: Bandwidth allocation | Download |
| 53 | Network Flows | Download |
| 54 | Reductions | Download |
| 55 | Checking Algorithms | Download |
| 56 | P and NP | Download |
| Sl.No | Chapter Name | Kannada |
|---|---|---|
| 1 | Course Outline | Download |
| 2 | Example: Air Travel | Download |
| 3 | Example: Xerox shop | Download |
| 4 | Example: Document similarity | Download |
| 5 | Introduction and motivation | Download |
| 6 | Input size, worst case, average case | Download |
| 7 | Quantifying efficiency: O( ), Omega( ), Theta( ) | Download |
| 8 | Examples: Analysis of iterative and recursive algorithms | Download |
| 9 | Arrays and lists | Download |
| 10 | Searching in an array | Download |
| 11 | Selection Sort | Download |
| 12 | Insertion sort | Download |
| 13 | Merge sort | Download |
| 14 | Merge sort - analysis | Download |
| 15 | Quicksort | Download |
| 16 | Quicksort - analysis | Download |
| 17 | Sorting - Concluding remarks | Download |
| 18 | Introduction to graphs | Download |
| 19 | Representing graphs | Download |
| 20 | Breadth first search (BFS) | Download |
| 21 | Depth first search (DFS) | Download |
| 22 | Applications of BFS and DFS | Download |
| 23 | Directed acylic graphs: topological sort | Download |
| 24 | Directed acylic graphs: longest paths | Download |
| 25 | Single source shortest paths: Dijkstras algorithm | Download |
| 26 | Dijkstras algorithm: analysis | Download |
| 27 | Negative edge weights: Bellman-Ford algorithm | Download |
| 28 | All pairs shortest paths | Download |
| 29 | Minimum Cost Spanning Trees | Download |
| 30 | Prims Algorithm | Download |
| 31 | Kruskals algorithm | Download |
| 32 | Union-Find using arrays | Download |
| 33 | Union-Find using pointers | Download |
| 34 | Priority queues | Download |
| 35 | Heaps | Download |
| 36 | Heaps: Updating values, sorting | Download |
| 37 | Counting inversions | Download |
| 38 | Closest pair of points | Download |
| 39 | Binary Search Trees | Download |
| 40 | Balanced search trees | Download |
| 41 | Interval scheduling | Download |
| 42 | Scheduling with deadlines: minimizing lateness | Download |
| 43 | Huffman codes | Download |
| 44 | Introduction to dynamic programming | Download |
| 45 | Memoization | Download |
| 46 | Grid Paths | Download |
| 47 | Common subwords and subsequences | Download |
| 48 | Edit distance | Download |
| 49 | Matrix multiplication | Download |
| 50 | Linear Programming | Download |
| 51 | LP modelling: Production Planning | Download |
| 52 | LP modelling: Bandwidth allocation | Download |
| 53 | Network Flows | Download |
| 54 | Reductions | Download |
| 55 | Checking Algorithms | Download |
| 56 | P and NP | Download |
| Sl.No | Chapter Name | Malayalam |
|---|---|---|
| 1 | Course Outline | Download |
| 2 | Example: Air Travel | Download |
| 3 | Example: Xerox shop | Download |
| 4 | Example: Document similarity | Download |
| 5 | Introduction and motivation | Download |
| 6 | Input size, worst case, average case | Download |
| 7 | Quantifying efficiency: O( ), Omega( ), Theta( ) | Download |
| 8 | Examples: Analysis of iterative and recursive algorithms | Download |
| 9 | Arrays and lists | Download |
| 10 | Searching in an array | Download |
| 11 | Selection Sort | Download |
| 12 | Insertion sort | Download |
| 13 | Merge sort | Download |
| 14 | Merge sort - analysis | Download |
| 15 | Quicksort | Download |
| 16 | Quicksort - analysis | Download |
| 17 | Sorting - Concluding remarks | Download |
| 18 | Introduction to graphs | Download |
| 19 | Representing graphs | Download |
| 20 | Breadth first search (BFS) | Download |
| 21 | Depth first search (DFS) | Download |
| 22 | Applications of BFS and DFS | Download |
| 23 | Directed acylic graphs: topological sort | Download |
| 24 | Directed acylic graphs: longest paths | Download |
| 25 | Single source shortest paths: Dijkstras algorithm | Download |
| 26 | Dijkstras algorithm: analysis | Download |
| 27 | Negative edge weights: Bellman-Ford algorithm | Download |
| 28 | All pairs shortest paths | Download |
| 29 | Minimum Cost Spanning Trees | Download |
| 30 | Prims Algorithm | Download |
| 31 | Kruskals algorithm | Download |
| 32 | Union-Find using arrays | Download |
| 33 | Union-Find using pointers | Download |
| 34 | Priority queues | Download |
| 35 | Heaps | Download |
| 36 | Heaps: Updating values, sorting | Download |
| 37 | Counting inversions | Download |
| 38 | Closest pair of points | Download |
| 39 | Binary Search Trees | Download |
| 40 | Balanced search trees | Download |
| 41 | Interval scheduling | Download |
| 42 | Scheduling with deadlines: minimizing lateness | Download |
| 43 | Huffman codes | Download |
| 44 | Introduction to dynamic programming | Download |
| 45 | Memoization | Download |
| 46 | Grid Paths | Download |
| 47 | Common subwords and subsequences | Download |
| 48 | Edit distance | Download |
| 49 | Matrix multiplication | Download |
| 50 | Linear Programming | Download |
| 51 | LP modelling: Production Planning | Download |
| 52 | LP modelling: Bandwidth allocation | Download |
| 53 | Network Flows | Download |
| 54 | Reductions | Download |
| 55 | Checking Algorithms | Download |
| 56 | P and NP | Download |
| Sl.No | Chapter Name | Marathi |
|---|---|---|
| 1 | Course Outline | Download |
| 2 | Example: Air Travel | Download |
| 3 | Example: Xerox shop | Download |
| 4 | Example: Document similarity | Download |
| 5 | Introduction and motivation | Download |
| 6 | Input size, worst case, average case | Download |
| 7 | Quantifying efficiency: O( ), Omega( ), Theta( ) | Download |
| 8 | Examples: Analysis of iterative and recursive algorithms | Download |
| 9 | Arrays and lists | Download |
| 10 | Searching in an array | Download |
| 11 | Selection Sort | Download |
| 12 | Insertion sort | Download |
| 13 | Merge sort | Download |
| 14 | Merge sort - analysis | Download |
| 15 | Quicksort | Download |
| 16 | Quicksort - analysis | Download |
| 17 | Sorting - Concluding remarks | Download |
| 18 | Introduction to graphs | Download |
| 19 | Representing graphs | Download |
| 20 | Breadth first search (BFS) | Download |
| 21 | Depth first search (DFS) | Download |
| 22 | Applications of BFS and DFS | Download |
| 23 | Directed acylic graphs: topological sort | Download |
| 24 | Directed acylic graphs: longest paths | Download |
| 25 | Single source shortest paths: Dijkstras algorithm | Download |
| 26 | Dijkstras algorithm: analysis | Download |
| 27 | Negative edge weights: Bellman-Ford algorithm | Download |
| 28 | All pairs shortest paths | Download |
| 29 | Minimum Cost Spanning Trees | Download |
| 30 | Prims Algorithm | Download |
| 31 | Kruskals algorithm | Download |
| 32 | Union-Find using arrays | Download |
| 33 | Union-Find using pointers | Download |
| 34 | Priority queues | Download |
| 35 | Heaps | Download |
| 36 | Heaps: Updating values, sorting | Download |
| 37 | Counting inversions | Download |
| 38 | Closest pair of points | Download |
| 39 | Binary Search Trees | Download |
| 40 | Balanced search trees | Download |
| 41 | Interval scheduling | Download |
| 42 | Scheduling with deadlines: minimizing lateness | Download |
| 43 | Huffman codes | Download |
| 44 | Introduction to dynamic programming | Download |
| 45 | Memoization | Download |
| 46 | Grid Paths | Download |
| 47 | Common subwords and subsequences | Download |
| 48 | Edit distance | Download |
| 49 | Matrix multiplication | Download |
| 50 | Linear Programming | Download |
| 51 | LP modelling: Production Planning | Download |
| 52 | LP modelling: Bandwidth allocation | Download |
| 53 | Network Flows | Download |
| 54 | Reductions | Download |
| 55 | Checking Algorithms | Download |
| 56 | P and NP | Download |
| Sl.No | Chapter Name | Tamil |
|---|---|---|
| 1 | Course Outline | Download |
| 2 | Example: Air Travel | Download |
| 3 | Example: Xerox shop | Download |
| 4 | Example: Document similarity | Download |
| 5 | Introduction and motivation | Download |
| 6 | Input size, worst case, average case | Download |
| 7 | Quantifying efficiency: O( ), Omega( ), Theta( ) | Download |
| 8 | Examples: Analysis of iterative and recursive algorithms | Download |
| 9 | Arrays and lists | Download |
| 10 | Searching in an array | Download |
| 11 | Selection Sort | Download |
| 12 | Insertion sort | Download |
| 13 | Merge sort | Download |
| 14 | Merge sort - analysis | Download |
| 15 | Quicksort | Download |
| 16 | Quicksort - analysis | Download |
| 17 | Sorting - Concluding remarks | Download |
| 18 | Introduction to graphs | Download |
| 19 | Representing graphs | Download |
| 20 | Breadth first search (BFS) | Download |
| 21 | Depth first search (DFS) | Download |
| 22 | Applications of BFS and DFS | Download |
| 23 | Directed acylic graphs: topological sort | Download |
| 24 | Directed acylic graphs: longest paths | Download |
| 25 | Single source shortest paths: Dijkstras algorithm | Download |
| 26 | Dijkstras algorithm: analysis | Download |
| 27 | Negative edge weights: Bellman-Ford algorithm | Download |
| 28 | All pairs shortest paths | Download |
| 29 | Minimum Cost Spanning Trees | Download |
| 30 | Prims Algorithm | Download |
| 31 | Kruskals algorithm | Download |
| 32 | Union-Find using arrays | Download |
| 33 | Union-Find using pointers | Download |
| 34 | Priority queues | Download |
| 35 | Heaps | Download |
| 36 | Heaps: Updating values, sorting | Download |
| 37 | Counting inversions | Download |
| 38 | Closest pair of points | Download |
| 39 | Binary Search Trees | Download |
| 40 | Balanced search trees | Download |
| 41 | Interval scheduling | Download |
| 42 | Scheduling with deadlines: minimizing lateness | Download |
| 43 | Huffman codes | Download |
| 44 | Introduction to dynamic programming | Download |
| 45 | Memoization | Download |
| 46 | Grid Paths | Download |
| 47 | Common subwords and subsequences | Download |
| 48 | Edit distance | Download |
| 49 | Matrix multiplication | Download |
| 50 | Linear Programming | Download |
| 51 | LP modelling: Production Planning | Download |
| 52 | LP modelling: Bandwidth allocation | Download |
| 53 | Network Flows | Download |
| 54 | Reductions | Download |
| 55 | Checking Algorithms | Download |
| 56 | P and NP | Download |
| Sl.No | Chapter Name | Telugu |
|---|---|---|
| 1 | Course Outline | Download |
| 2 | Example: Air Travel | Download |
| 3 | Example: Xerox shop | Download |
| 4 | Example: Document similarity | Download |
| 5 | Introduction and motivation | Download |
| 6 | Input size, worst case, average case | Download |
| 7 | Quantifying efficiency: O( ), Omega( ), Theta( ) | Download |
| 8 | Examples: Analysis of iterative and recursive algorithms | Download |
| 9 | Arrays and lists | Download |
| 10 | Searching in an array | Download |
| 11 | Selection Sort | Download |
| 12 | Insertion sort | Download |
| 13 | Merge sort | Download |
| 14 | Merge sort - analysis | Download |
| 15 | Quicksort | Download |
| 16 | Quicksort - analysis | Download |
| 17 | Sorting - Concluding remarks | Download |
| 18 | Introduction to graphs | Download |
| 19 | Representing graphs | Download |
| 20 | Breadth first search (BFS) | Download |
| 21 | Depth first search (DFS) | Download |
| 22 | Applications of BFS and DFS | Download |
| 23 | Directed acylic graphs: topological sort | Download |
| 24 | Directed acylic graphs: longest paths | Download |
| 25 | Single source shortest paths: Dijkstras algorithm | Download |
| 26 | Dijkstras algorithm: analysis | Download |
| 27 | Negative edge weights: Bellman-Ford algorithm | Download |
| 28 | All pairs shortest paths | Download |
| 29 | Minimum Cost Spanning Trees | Download |
| 30 | Prims Algorithm | Download |
| 31 | Kruskals algorithm | Download |
| 32 | Union-Find using arrays | Download |
| 33 | Union-Find using pointers | Download |
| 34 | Priority queues | Download |
| 35 | Heaps | Download |
| 36 | Heaps: Updating values, sorting | Download |
| 37 | Counting inversions | Download |
| 38 | Closest pair of points | Download |
| 39 | Binary Search Trees | Download |
| 40 | Balanced search trees | Download |
| 41 | Interval scheduling | Download |
| 42 | Scheduling with deadlines: minimizing lateness | Download |
| 43 | Huffman codes | Download |
| 44 | Introduction to dynamic programming | Download |
| 45 | Memoization | Download |
| 46 | Grid Paths | Download |
| 47 | Common subwords and subsequences | Download |
| 48 | Edit distance | Download |
| 49 | Matrix multiplication | Download |
| 50 | Linear Programming | Download |
| 51 | LP modelling: Production Planning | Download |
| 52 | LP modelling: Bandwidth allocation | Download |
| 53 | Network Flows | Download |
| 54 | Reductions | Download |
| 55 | Checking Algorithms | Download |
| 56 | P and NP | Download |