| Module Name | Download |
|---|---|
| noc20-cs26_Week_01_Assignment_01 | noc20-cs26_Week_01_Assignment_01 |
| noc20-cs26_Week_02_Assignment_01 | noc20-cs26_Week_02_Assignment_01 |
| noc20-cs26_Week_02_Assignment_02 | noc20-cs26_Week_02_Assignment_02 |
| noc20-cs26_Week_03_Assignment_01 | noc20-cs26_Week_03_Assignment_01 |
| noc20-cs26_Week_03_Assignment_02 | noc20-cs26_Week_03_Assignment_02 |
| noc20-cs26_Week_04_Assignment_01 | noc20-cs26_Week_04_Assignment_01 |
| noc20-cs26_Week_04_Assignment_02 | noc20-cs26_Week_04_Assignment_02 |
| noc20-cs26_Week_05_Assignment_01 | noc20-cs26_Week_05_Assignment_01 |
| noc20-cs26_Week_06_Assignment_01 | noc20-cs26_Week_06_Assignment_01 |
| noc20-cs26_Week_07_Assignment_01 | noc20-cs26_Week_07_Assignment_01 |
| noc20-cs26_Week_08_Assignment_01 | noc20-cs26_Week_08_Assignment_01 |
| Sl.No | Chapter Name | MP4 Download |
|---|---|---|
| 1 | Lecture 1: Algorithms and programming: simple gcd | Download |
| 2 | Lecture 2: Improving naive gcd | Download |
| 3 | Lecture 3: Euclid's algorithm for gcd | Download |
| 4 | Lecture 4: Downloading and installing Python | Download |
| 5 | Lecture 1: Assignment statement, basic types - int, float, bool | Download |
| 6 | Lecture 2: Strings | Download |
| 7 | Lecture 3: Lists | Download |
| 8 | Lecture 4: Control Flow | Download |
| 9 | Lecture 5: Functions | Download |
| 10 | Lecture 6: Examples | Download |
| 11 | Lecture 1: More about range() | Download |
| 12 | Lecture 2: Manipulating lists | Download |
| 13 | Lecture 3: Breaking out of a loop | Download |
| 14 | Lecture 4: Arrays vs lists, binary search | Download |
| 15 | Lecture 5: Efficiency | Download |
| 16 | Lecture 6: Selection Sort | Download |
| 17 | Lecture 7: Insertion Sort | Download |
| 18 | Lecture 8: Recursion | Download |
| 19 | Lecture 1: Mergesort | Download |
| 20 | Lecture 2: Mergesort, analysis | Download |
| 21 | Lecture 3: Quicksort | Download |
| 22 | Lecture 4: Quicksort analysis | Download |
| 23 | Lecture 5: Tuples and dictionaries | Download |
| 24 | Lecture 6: Function definitions | Download |
| 25 | Lecture 7: List Comprehension | Download |
| 26 | Lecture 1: Exception Handling | Download |
| 27 | Lecture 2:Standard input and output | Download |
| 28 | Lecture 3: Handling files | Download |
| 29 | Lecture 4: String functions | Download |
| 30 | Lecture 5:Formatting printed output | Download |
| 31 | Lecture 6: pass, del() and None | Download |
| 32 | Lecture 1: Backtracking, N queens | Download |
| 33 | Lecture 2: Global scope, nested functions | Download |
| 34 | Lecture 3: Generating permutations | Download |
| 35 | Lecture 4: Sets, stacks, queues | Download |
| 36 | Lecture 5: Priority queues and heaps | Download |
| 37 | Lecture 1: Abstract datatypes, classes and objects | Download |
| 38 | Lecture 2: Classes and objects in Python | Download |
| 39 | Lecture 3: User defined lists | Download |
| 40 | Lecture 4: Search trees | Download |
| 41 | Lecture 1: Memoization and dynamic programming | Download |
| 42 | Lecture 2: Grid paths | Download |
| 43 | Lesson 3: Longest common subsequence | Download |
| 44 | Lecture 4: Matrix multiplication | Download |
| 45 | Lecture 5: Wrap-up, Python vs other languages | Download |
| Sl.No | Chapter Name | English |
|---|---|---|
| 1 | Lecture 1: Algorithms and programming: simple gcd | Download Verified |
| 2 | Lecture 2: Improving naive gcd | Download Verified |
| 3 | Lecture 3: Euclid's algorithm for gcd | Download Verified |
| 4 | Lecture 4: Downloading and installing Python | Download Verified |
| 5 | Lecture 1: Assignment statement, basic types - int, float, bool | Download Verified |
| 6 | Lecture 2: Strings | Download Verified |
| 7 | Lecture 3: Lists | Download Verified |
| 8 | Lecture 4: Control Flow | Download Verified |
| 9 | Lecture 5: Functions | Download Verified |
| 10 | Lecture 6: Examples | Download Verified |
| 11 | Lecture 1: More about range() | Download Verified |
| 12 | Lecture 2: Manipulating lists | Download Verified |
| 13 | Lecture 3: Breaking out of a loop | Download Verified |
| 14 | Lecture 4: Arrays vs lists, binary search | Download Verified |
| 15 | Lecture 5: Efficiency | Download Verified |
| 16 | Lecture 6: Selection Sort | Download Verified |
| 17 | Lecture 7: Insertion Sort | Download Verified |
| 18 | Lecture 8: Recursion | Download Verified |
| 19 | Lecture 1: Mergesort | Download Verified |
| 20 | Lecture 2: Mergesort, analysis | Download Verified |
| 21 | Lecture 3: Quicksort | Download Verified |
| 22 | Lecture 4: Quicksort analysis | Download Verified |
| 23 | Lecture 5: Tuples and dictionaries | Download Verified |
| 24 | Lecture 6: Function definitions | Download Verified |
| 25 | Lecture 7: List Comprehension | Download Verified |
| 26 | Lecture 1: Exception Handling | Download Verified |
| 27 | Lecture 2:Standard input and output | Download Verified |
| 28 | Lecture 3: Handling files | Download Verified |
| 29 | Lecture 4: String functions | Download Verified |
| 30 | Lecture 5:Formatting printed output | Download Verified |
| 31 | Lecture 6: pass, del() and None | Download Verified |
| 32 | Lecture 1: Backtracking, N queens | Download Verified |
| 33 | Lecture 2: Global scope, nested functions | Download Verified |
| 34 | Lecture 3: Generating permutations | Download Verified |
| 35 | Lecture 4: Sets, stacks, queues | Download Verified |
| 36 | Lecture 5: Priority queues and heaps | Download Verified |
| 37 | Lecture 1: Abstract datatypes, classes and objects | Download Verified |
| 38 | Lecture 2: Classes and objects in Python | Download Verified |
| 39 | Lecture 3: User defined lists | Download Verified |
| 40 | Lecture 4: Search trees | Download Verified |
| 41 | Lecture 1: Memoization and dynamic programming | Download Verified |
| 42 | Lecture 2: Grid paths | Download Verified |
| 43 | Lesson 3: Longest common subsequence | Download Verified |
| 44 | Lecture 4: Matrix multiplication | Download Verified |
| 45 | Lecture 5: Wrap-up, Python vs other languages | Download Verified |
| Sl.No | Chapter Name | Bengali |
|---|---|---|
| 1 | Lecture 1: Algorithms and programming: simple gcd | Download |
| 2 | Lecture 2: Improving naive gcd | Download |
| 3 | Lecture 3: Euclid's algorithm for gcd | Download |
| 4 | Lecture 4: Downloading and installing Python | Download |
| 5 | Lecture 1: Assignment statement, basic types - int, float, bool | Download |
| 6 | Lecture 2: Strings | Download |
| 7 | Lecture 3: Lists | Download |
| 8 | Lecture 4: Control Flow | Download |
| 9 | Lecture 5: Functions | Download |
| 10 | Lecture 6: Examples | Download |
| 11 | Lecture 1: More about range() | Download |
| 12 | Lecture 2: Manipulating lists | Download |
| 13 | Lecture 3: Breaking out of a loop | Download |
| 14 | Lecture 4: Arrays vs lists, binary search | Download |
| 15 | Lecture 5: Efficiency | Download |
| 16 | Lecture 6: Selection Sort | Download |
| 17 | Lecture 7: Insertion Sort | Download |
| 18 | Lecture 8: Recursion | Download |
| 19 | Lecture 1: Mergesort | Download |
| 20 | Lecture 2: Mergesort, analysis | Download |
| 21 | Lecture 3: Quicksort | Download |
| 22 | Lecture 4: Quicksort analysis | Download |
| 23 | Lecture 5: Tuples and dictionaries | Download |
| 24 | Lecture 6: Function definitions | Download |
| 25 | Lecture 7: List Comprehension | Download |
| 26 | Lecture 1: Exception Handling | Download |
| 27 | Lecture 2:Standard input and output | Download |
| 28 | Lecture 3: Handling files | Download |
| 29 | Lecture 4: String functions | Download |
| 30 | Lecture 5:Formatting printed output | Download |
| 31 | Lecture 6: pass, del() and None | Download |
| 32 | Lecture 1: Backtracking, N queens | Download |
| 33 | Lecture 2: Global scope, nested functions | Download |
| 34 | Lecture 3: Generating permutations | Download |
| 35 | Lecture 4: Sets, stacks, queues | Download |
| 36 | Lecture 5: Priority queues and heaps | Download |
| 37 | Lecture 1: Abstract datatypes, classes and objects | Download |
| 38 | Lecture 2: Classes and objects in Python | Download |
| 39 | Lecture 3: User defined lists | Download |
| 40 | Lecture 4: Search trees | Download |
| 41 | Lecture 1: Memoization and dynamic programming | Download |
| 42 | Lecture 2: Grid paths | Download |
| 43 | Lesson 3: Longest common subsequence | Download |
| 44 | Lecture 4: Matrix multiplication | Download |
| 45 | Lecture 5: Wrap-up, Python vs other languages | Download |
| Sl.No | Chapter Name | Gujarati |
|---|---|---|
| 1 | Lecture 1: Algorithms and programming: simple gcd | Download |
| 2 | Lecture 2: Improving naive gcd | Download |
| 3 | Lecture 3: Euclid's algorithm for gcd | Download |
| 4 | Lecture 4: Downloading and installing Python | Download |
| 5 | Lecture 1: Assignment statement, basic types - int, float, bool | Download |
| 6 | Lecture 2: Strings | Download |
| 7 | Lecture 3: Lists | Download |
| 8 | Lecture 4: Control Flow | Download |
| 9 | Lecture 5: Functions | Download |
| 10 | Lecture 6: Examples | Download |
| 11 | Lecture 1: More about range() | Download |
| 12 | Lecture 2: Manipulating lists | Download |
| 13 | Lecture 3: Breaking out of a loop | Download |
| 14 | Lecture 4: Arrays vs lists, binary search | Download |
| 15 | Lecture 5: Efficiency | Download |
| 16 | Lecture 6: Selection Sort | Download |
| 17 | Lecture 7: Insertion Sort | Download |
| 18 | Lecture 8: Recursion | Download |
| 19 | Lecture 1: Mergesort | Download |
| 20 | Lecture 2: Mergesort, analysis | Download |
| 21 | Lecture 3: Quicksort | Download |
| 22 | Lecture 4: Quicksort analysis | Download |
| 23 | Lecture 5: Tuples and dictionaries | Download |
| 24 | Lecture 6: Function definitions | Download |
| 25 | Lecture 7: List Comprehension | Download |
| 26 | Lecture 1: Exception Handling | Download |
| 27 | Lecture 2:Standard input and output | Download |
| 28 | Lecture 3: Handling files | Download |
| 29 | Lecture 4: String functions | Download |
| 30 | Lecture 5:Formatting printed output | Download |
| 31 | Lecture 6: pass, del() and None | Download |
| 32 | Lecture 1: Backtracking, N queens | Download |
| 33 | Lecture 2: Global scope, nested functions | Download |
| 34 | Lecture 3: Generating permutations | Download |
| 35 | Lecture 4: Sets, stacks, queues | Download |
| 36 | Lecture 5: Priority queues and heaps | Download |
| 37 | Lecture 1: Abstract datatypes, classes and objects | Download |
| 38 | Lecture 2: Classes and objects in Python | Download |
| 39 | Lecture 3: User defined lists | Download |
| 40 | Lecture 4: Search trees | Download |
| 41 | Lecture 1: Memoization and dynamic programming | Download |
| 42 | Lecture 2: Grid paths | Download |
| 43 | Lesson 3: Longest common subsequence | Download |
| 44 | Lecture 4: Matrix multiplication | Download |
| 45 | Lecture 5: Wrap-up, Python vs other languages | Download |
| Sl.No | Chapter Name | Hindi |
|---|---|---|
| 1 | Lecture 1: Algorithms and programming: simple gcd | Download |
| 2 | Lecture 2: Improving naive gcd | Download |
| 3 | Lecture 3: Euclid's algorithm for gcd | Download |
| 4 | Lecture 4: Downloading and installing Python | Download |
| 5 | Lecture 1: Assignment statement, basic types - int, float, bool | Download |
| 6 | Lecture 2: Strings | Download |
| 7 | Lecture 3: Lists | Download |
| 8 | Lecture 4: Control Flow | Download |
| 9 | Lecture 5: Functions | Download |
| 10 | Lecture 6: Examples | Download |
| 11 | Lecture 1: More about range() | Download |
| 12 | Lecture 2: Manipulating lists | Download |
| 13 | Lecture 3: Breaking out of a loop | Download |
| 14 | Lecture 4: Arrays vs lists, binary search | Download |
| 15 | Lecture 5: Efficiency | Download |
| 16 | Lecture 6: Selection Sort | Download |
| 17 | Lecture 7: Insertion Sort | Download |
| 18 | Lecture 8: Recursion | Download |
| 19 | Lecture 1: Mergesort | Download |
| 20 | Lecture 2: Mergesort, analysis | Download |
| 21 | Lecture 3: Quicksort | Download |
| 22 | Lecture 4: Quicksort analysis | Download |
| 23 | Lecture 5: Tuples and dictionaries | Download |
| 24 | Lecture 6: Function definitions | Download |
| 25 | Lecture 7: List Comprehension | Download |
| 26 | Lecture 1: Exception Handling | Download |
| 27 | Lecture 2:Standard input and output | Download |
| 28 | Lecture 3: Handling files | Download |
| 29 | Lecture 4: String functions | Download |
| 30 | Lecture 5:Formatting printed output | Download |
| 31 | Lecture 6: pass, del() and None | Download |
| 32 | Lecture 1: Backtracking, N queens | Download |
| 33 | Lecture 2: Global scope, nested functions | Download |
| 34 | Lecture 3: Generating permutations | Download |
| 35 | Lecture 4: Sets, stacks, queues | Download |
| 36 | Lecture 5: Priority queues and heaps | Download |
| 37 | Lecture 1: Abstract datatypes, classes and objects | Download |
| 38 | Lecture 2: Classes and objects in Python | Download |
| 39 | Lecture 3: User defined lists | Download |
| 40 | Lecture 4: Search trees | Download |
| 41 | Lecture 1: Memoization and dynamic programming | Download |
| 42 | Lecture 2: Grid paths | Download |
| 43 | Lesson 3: Longest common subsequence | Download |
| 44 | Lecture 4: Matrix multiplication | Download |
| 45 | Lecture 5: Wrap-up, Python vs other languages | Download |
| Sl.No | Chapter Name | Kannada |
|---|---|---|
| 1 | Lecture 1: Algorithms and programming: simple gcd | Download |
| 2 | Lecture 2: Improving naive gcd | Download |
| 3 | Lecture 3: Euclid's algorithm for gcd | Download |
| 4 | Lecture 4: Downloading and installing Python | Download |
| 5 | Lecture 1: Assignment statement, basic types - int, float, bool | Download |
| 6 | Lecture 2: Strings | Download |
| 7 | Lecture 3: Lists | Download |
| 8 | Lecture 4: Control Flow | Download |
| 9 | Lecture 5: Functions | Download |
| 10 | Lecture 6: Examples | Download |
| 11 | Lecture 1: More about range() | Download |
| 12 | Lecture 2: Manipulating lists | Download |
| 13 | Lecture 3: Breaking out of a loop | Download |
| 14 | Lecture 4: Arrays vs lists, binary search | Download |
| 15 | Lecture 5: Efficiency | Download |
| 16 | Lecture 6: Selection Sort | Download |
| 17 | Lecture 7: Insertion Sort | Download |
| 18 | Lecture 8: Recursion | Download |
| 19 | Lecture 1: Mergesort | Download |
| 20 | Lecture 2: Mergesort, analysis | Download |
| 21 | Lecture 3: Quicksort | Download |
| 22 | Lecture 4: Quicksort analysis | Download |
| 23 | Lecture 5: Tuples and dictionaries | Download |
| 24 | Lecture 6: Function definitions | Download |
| 25 | Lecture 7: List Comprehension | Download |
| 26 | Lecture 1: Exception Handling | Download |
| 27 | Lecture 2:Standard input and output | Download |
| 28 | Lecture 3: Handling files | Download |
| 29 | Lecture 4: String functions | Download |
| 30 | Lecture 5:Formatting printed output | Download |
| 31 | Lecture 6: pass, del() and None | Download |
| 32 | Lecture 1: Backtracking, N queens | Download |
| 33 | Lecture 2: Global scope, nested functions | Download |
| 34 | Lecture 3: Generating permutations | Download |
| 35 | Lecture 4: Sets, stacks, queues | Download |
| 36 | Lecture 5: Priority queues and heaps | Download |
| 37 | Lecture 1: Abstract datatypes, classes and objects | Download |
| 38 | Lecture 2: Classes and objects in Python | Download |
| 39 | Lecture 3: User defined lists | Download |
| 40 | Lecture 4: Search trees | Download |
| 41 | Lecture 1: Memoization and dynamic programming | Download |
| 42 | Lecture 2: Grid paths | Download |
| 43 | Lesson 3: Longest common subsequence | Download |
| 44 | Lecture 4: Matrix multiplication | Download |
| 45 | Lecture 5: Wrap-up, Python vs other languages | Download |
| Sl.No | Chapter Name | Malayalam |
|---|---|---|
| 1 | Lecture 1: Algorithms and programming: simple gcd | Download |
| 2 | Lecture 2: Improving naive gcd | Download |
| 3 | Lecture 3: Euclid's algorithm for gcd | Download |
| 4 | Lecture 4: Downloading and installing Python | Download |
| 5 | Lecture 1: Assignment statement, basic types - int, float, bool | Download |
| 6 | Lecture 2: Strings | Download |
| 7 | Lecture 3: Lists | Download |
| 8 | Lecture 4: Control Flow | Download |
| 9 | Lecture 5: Functions | Download |
| 10 | Lecture 6: Examples | Download |
| 11 | Lecture 1: More about range() | Download |
| 12 | Lecture 2: Manipulating lists | Download |
| 13 | Lecture 3: Breaking out of a loop | Download |
| 14 | Lecture 4: Arrays vs lists, binary search | Download |
| 15 | Lecture 5: Efficiency | Download |
| 16 | Lecture 6: Selection Sort | Download |
| 17 | Lecture 7: Insertion Sort | Download |
| 18 | Lecture 8: Recursion | Download |
| 19 | Lecture 1: Mergesort | Download |
| 20 | Lecture 2: Mergesort, analysis | Download |
| 21 | Lecture 3: Quicksort | Download |
| 22 | Lecture 4: Quicksort analysis | Download |
| 23 | Lecture 5: Tuples and dictionaries | Download |
| 24 | Lecture 6: Function definitions | Download |
| 25 | Lecture 7: List Comprehension | Download |
| 26 | Lecture 1: Exception Handling | Download |
| 27 | Lecture 2:Standard input and output | Download |
| 28 | Lecture 3: Handling files | Download |
| 29 | Lecture 4: String functions | Download |
| 30 | Lecture 5:Formatting printed output | Download |
| 31 | Lecture 6: pass, del() and None | Download |
| 32 | Lecture 1: Backtracking, N queens | Download |
| 33 | Lecture 2: Global scope, nested functions | Download |
| 34 | Lecture 3: Generating permutations | Download |
| 35 | Lecture 4: Sets, stacks, queues | Download |
| 36 | Lecture 5: Priority queues and heaps | Download |
| 37 | Lecture 1: Abstract datatypes, classes and objects | Download |
| 38 | Lecture 2: Classes and objects in Python | Download |
| 39 | Lecture 3: User defined lists | Download |
| 40 | Lecture 4: Search trees | Download |
| 41 | Lecture 1: Memoization and dynamic programming | Download |
| 42 | Lecture 2: Grid paths | Download |
| 43 | Lesson 3: Longest common subsequence | Download |
| 44 | Lecture 4: Matrix multiplication | Download |
| 45 | Lecture 5: Wrap-up, Python vs other languages | Download |
| Sl.No | Chapter Name | Tamil |
|---|---|---|
| 1 | Lecture 1: Algorithms and programming: simple gcd | Download |
| 2 | Lecture 2: Improving naive gcd | Download |
| 3 | Lecture 3: Euclid's algorithm for gcd | Download |
| 4 | Lecture 4: Downloading and installing Python | Download |
| 5 | Lecture 1: Assignment statement, basic types - int, float, bool | Download |
| 6 | Lecture 2: Strings | Download |
| 7 | Lecture 3: Lists | Download |
| 8 | Lecture 4: Control Flow | Download |
| 9 | Lecture 5: Functions | Download |
| 10 | Lecture 6: Examples | Download |
| 11 | Lecture 1: More about range() | Download |
| 12 | Lecture 2: Manipulating lists | Download |
| 13 | Lecture 3: Breaking out of a loop | Download |
| 14 | Lecture 4: Arrays vs lists, binary search | Download |
| 15 | Lecture 5: Efficiency | Download |
| 16 | Lecture 6: Selection Sort | Download |
| 17 | Lecture 7: Insertion Sort | Download |
| 18 | Lecture 8: Recursion | Download |
| 19 | Lecture 1: Mergesort | Download |
| 20 | Lecture 2: Mergesort, analysis | Download |
| 21 | Lecture 3: Quicksort | Download |
| 22 | Lecture 4: Quicksort analysis | Download |
| 23 | Lecture 5: Tuples and dictionaries | Download |
| 24 | Lecture 6: Function definitions | Download |
| 25 | Lecture 7: List Comprehension | Download |
| 26 | Lecture 1: Exception Handling | Download |
| 27 | Lecture 2:Standard input and output | Download |
| 28 | Lecture 3: Handling files | Download |
| 29 | Lecture 4: String functions | Download |
| 30 | Lecture 5:Formatting printed output | Download |
| 31 | Lecture 6: pass, del() and None | Download |
| 32 | Lecture 1: Backtracking, N queens | Download |
| 33 | Lecture 2: Global scope, nested functions | Download |
| 34 | Lecture 3: Generating permutations | Download |
| 35 | Lecture 4: Sets, stacks, queues | Download |
| 36 | Lecture 5: Priority queues and heaps | Download |
| 37 | Lecture 1: Abstract datatypes, classes and objects | Download |
| 38 | Lecture 2: Classes and objects in Python | Download |
| 39 | Lecture 3: User defined lists | Download |
| 40 | Lecture 4: Search trees | Download |
| 41 | Lecture 1: Memoization and dynamic programming | Download |
| 42 | Lecture 2: Grid paths | Download |
| 43 | Lesson 3: Longest common subsequence | Download |
| 44 | Lecture 4: Matrix multiplication | Download |
| 45 | Lecture 5: Wrap-up, Python vs other languages | Download |