Profile
Settings
Refer your friends
Sign out
Algorithms have around 8% weightage in the GATE exam. Along with studying algorithm techniques and time and space complexity, some other important topics from Algorithms are Sorting Algorithms, Algorithm Analysis, Heaps, Graph Algorithms, Divide and Conquer & Greedy Algorithms. Learners should expect around 6 to 8 marks in GATE Paper.
| Lecture Number | Topic Name | Video Link |
| Lecture-1 | Introduction to asymptotic notations | Watch now |
| Lecture-2 | Time complexity Analysis of iterative programs | Watch now |
| Lecture-3 | Time Analysis of Recursive Program | GATE CS/IT #RavindrababuRaula | Watch now |
| Lecture-4 | Comparing various functions to analyse time complexity | Watch now |
| Lecture-5 | Masters theorem | Watch now |
| Lecture-6 | Analysing Space complexity of iterative and recursive algorithms | Watch now |
| Lecture-7 | Insertion sort algorithm and analysis | GATE CS/IT #RavindrababuRaula | Watch now |
| Lecture-8 | Merge sort algorithm, analysis and problems | Watch now |
| Lecture-9 | Quick sort algorithm | GATE CS/IT #RavindrababuRaula | Watch now |
| Lecture-10 | Analysis of quick sort and problems on it | Watch now |
| Lecture-11 | Introduction to heaps | Watch now |
| Lecture-12 | Max heapify algorithm and complete binary tree | Watch now |
| Lecture-13 | Build max heap algorithm and analysis | Watch now |
| Lecture-14 | Extract max, increase key and insert key into heap | Watch now |
| Lecture-15 | About the lectures | Watch now |
| Lecture-16 | Analysis of Algorithms Practice Questions Part-1 | Watch now |
| Lecture-17 | Analysis of Algorithms Practice Questions Part-2 | Watch now |
| Lecture-18 | Asymptotic Notations and Recurrence Relations Practice Questions | Watch now |
| Lecture-19 | C-Programming, Recursion, Array Practice Questions | Watch now |
| Lecture-20 | Programming and Data Structures Practice Questions | P and DS | Watch now |
| Lecture-21 | Asymptotic time and space complexity Part-1 Practice Questions | Watch now |
