There are no items in your cart
Add More
Add More
Item Details | Price |
---|
Learn, Understand, Discuss. "GO" for the Best.
Instructor: Sachin Mittal(MTech IISc Bangalore, Ex-Amazon Scientist, GATE AIR 33)
Language: English
Features of the course:
1. Quality Content: No Rote-learning. No poor understadning. No By-hearting of formulas, tables or theorems. Understand everything with proofs-intuitions-ideas.
2. No Prerequisites: Every concept is taught from basics, without assuming any prior knowledge whatsoever.
3. Daily Homeworks: Practice material, with solutions, for Every Lecture to test your understanding of concepts of respective lecture.
4. Summary Lectures: Short videos which summarises every concept and detail of the course. Helps in quick revision.
5. Quality Practice Sets: Practice Sets from standard resources, with solutions, containing a lot of quality questions for practice.
6. Weekly Quizzes: Every week, there will be a Live Quiz, containing 15-20 questions, to evaluate your understanding of concepts taught in the previous week. The Quiz questions can be seen, solved even after tha live quiz is over.
7. Doubt Resolution: All your doubts will be resolved directly by the faculty. There is a dedicated Telegram group for Enrolled Students of Goclasses where our faculties resolve students' doubts. So, our students don't have to go anywhere else for asking doubts.
Enroll Now.
Enroll here for Goclasses GATE CSE 2023 Complete Course
1. Why Study Algorithms | |||
2.An algorithm that changed history And Child's algorithm | |||
Time Complexity of Recursive Programs | |||
Introduction to recurrance relations | |||
Solving recurrence using Iteration Method | |||
More Examples of Iteration Method | |||
Even more examples for iteration method. (will be uploaded on 21st June) | |||
Solving recurrence using Tree Method | |||
More Examples Tree Method | |||
Even More Examples Tree Method | |||
More Examples Tree Method | |||
Masters Theorem Idea and examples | |||
Examples On Master Theorem | |||
[Optional] Proof of Master Theorem | |||
Generalised Master Theorem | |||
[Optional] Extended Master Theorem | |||
Various Examples of Master Theorem | |||
Problems that master theorem can not solve | |||
Introduction to change to variable method | |||
Examples on Change of Variable | |||
Few more examples on change of variable method | |||
Some More variation | |||
Solving Reccurance Relations | |||
Divide and Conquer algorithms Part 1 | |||
1 .Introduction to Divide and Conquer Algorithm | |||
2. Maximum of an array using D and C | |||
3. Example 2- Sum of an array | |||
4. Example 3- Search in an array | |||
5. Example 4 - Dumb Sort | |||
6. Viewing Recurrence as Induction | |||
7.Introduction to Merge Sort algorithm | |||
8.Heart of Merge Sort- Merge Procedure | |||
9.Merge Procedure -2 | |||
10. Merge Sort Recursive tree with example | |||
11. Merge Sort questions -1 | |||
12. Merge Sort questions -2 | |||
Incomplete D and C notes | |||
13. More Questions on Merge sort | |||
14. Iterative (or Bottom-up)Merge sort | |||
GATE 1999 question on Bottom up Merge Sort | |||
15. Time Complexity of Iterative Merge sort | |||
16. [Optional] Implementation of Iterative Merge sort | |||
17. Merging k sorted arrays Part 1 | |||
18. Merging k sorted arrays Part 2 | |||
19. Definition of Stable and In-place sorting | |||
[DELETED] In Place and Space Complexity | |||
D and C Part 1 notes | |||
Maximum and Minimum Of Numbers | |||
1. Maximum and Second Max of an array | |||
2. Second maximum using Tournament Method | |||
3. [Optional] How to keep track for candidates of Second maximum | |||
4. Maximum and Minimum of an array | |||
5. Tournament Method and D&C for Max Min in an array | |||
6. Cormen questions | |||
7. GATE 2007, 2014, 2021 Questions | |||
Maximum and Minimum Notes | |||
Algorithms: Best Case, Worst Case and Average Case | |||
1. Algorithm Analysis | |||
2. Questions on Algorithm Analysis | |||
Algorithm Analysis Notes | |||
Divide and Conquer Part 2 | |||
1. Counting inversion with Netflix and Amazon Example | |||
2. Numerical questions on Counting Inversion | |||
3. Counting Inversions using BruteForce method | |||
4. Heart of counting Inversion | |||
5. Working Example of Counting Inversion using D and C | |||
6. Counting Inversion question | |||
7.Closest pair in 2 D | |||
8.Closest pair-2 | |||
9. Exponent of a number | |||
10. Matrix Multiplication | |||
11. Introduction to Quick Sort | |||
12. Working Example of Quick Sort | |||
13. Quick sort Analysis and Randomised quick sort | |||
14. GATE 2014 question | |||
15. Questions on quick sort | |||
16. [Optional and Skip] Average case analysis of quick sort | |||
17. The Select algorithm | |||
18. Binary Search | |||
Annotated notes Divide and Conquer part 2 | |||
Sorting Algorithms (selection, insertion, bubble, counting sort) | |||
LIVE Lecture Sorting | |||
Bubble Insertion sort Annotated Notes | |||
LIVE Counting sort, radix sort | |||
Counting sort, radix sort Annotates Notes | |||
Graphs | |||
1. Introduction to Graphs | Adjacency List and Matrix | |||
2. intuition for graph search methods | |||
3. Introduction to DFS | |||
4. DFS Implementation (Recursive and explicit stack) and Time complexity | |||
5. DFS Parentheses Theorem | GATE 2006 | |||
6. DFS Edge Classifications | |||
7. Questions on DFS Edge Classification | |||
8. [Optional] Back-edge and cycle question | |||
9. DFS Application 1- Cycles in graph | |||
10. GATE 2007 question on DAG finish time | |||
11. DFS Application 2 Topological sort | GATE 2014 | |||
12. DFS Application 3 Articulation Point | GATE 2021 | |||
13. Introduction to BFS | |||
14. BFS few Observations(Properties) and BFS Edge Classification | |||
15. BFS Applications | |||
DFS BFS Annotated Notes | |||
Greedy Algorithms | |||
1. Introduction to Greedy Algorithms | Introduction and Intuitive proof of Dijkstra | |||
2. Dijkstra code and Working Example 1 | |||
3. Dijkstra Working Example 2 | |||
4. Dijkstra Working Example 3 | |||
5. Dijkstra on negative weights | |||
Video from Data Structures Course: Priority Queues | |||
6. Dijkstra Time Complexity | |||
Greedy Incomplete | |||
7. Dijkstra Time Complexity on more variant data structures | Dijkstra Demo | |||
8. DAG Shortest Path | |||
Intuition Behind Bellman Ford Algorithm | |||
9. Examples of Bellman Ford | Time complexity | |||
10. Bellman ford proof and Early termination | |||
1. Why Minimum Spanning Trees | |||
2. Cut and Cycle properties of MST | |||
3. Kruskal Algorithm | |||
4. Questions on MSTs | |||
Greedy Notes 2 | |||
Live Classes | |||
Lecture 1: Minimum Spanning Trees and Prims | |||
Live Lecture 1 Annotated Notes | |||
Lecture 2: Minimum Spanning tree questions, Huffman encoding | |||
Lecture 2 Annotated Notes | |||
Lecture 3 Job Scheduling (Greedy) and Fractional Knapsack | |||
Lecture 3b: Introduction to DP | |||
Lecture 3 Annotated Notes | |||
Lecture 4: Dynamic Programing. Let's Begin | |||
Lecture 4 Annotated Notes | |||
Lecture 5: More DP Matrix Chain Multiplication | |||
Lecture 5b 0-1 Knapsack | |||
Lecture 5 Annotated Notes | |||
Lecture 6: Subset Sum, Coin Change | |||
Lecture 6 Annotated Notes | |||
Lecture 6b: [Optional] Some More variations in DP | |||
[Optional] Lecture 6b Annotated Notes |
After successful purchase, this item would be added to your courses.
You can access your courses in the following ways :