There are no items in your cart
Add More
Add More
Item Details | Price |
---|
Unlock the Power of Algorithms: Master the Art of Problem Solving, Complexity Analysis, and Optimization Strategies in the Revolutionary World of Computing in 2024!
Learn, Understand, Discuss. "GO" for the Best.
star star star star star | 5.0 (19 ratings) |
Instructor: Sachin Mittal(MTech IISc Bangalore, Ex-Amazon Scientist, GATE AIR 33)
Language: English
Validity Period: 365 days
Description:
Algorithms 2024 is a comprehensive course that introduces students to the fundamental concepts and techniques of algorithms. Through a combination of theoretical lectures and practical exercises, students will gain a solid understanding of algorithms and their applications in problem-solving.
Key Highlights:
What you will learn:
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
Why Study Algorithms | |||
1a. Why Study Algorithms 13:00 | |||
1b.An algorithm that changed history And Child's algorithm 9:00 | |||
Asymptotic Analysis and Loop Complexities (DS Course Videos) | |||
DS Videos: 5a. Introduction to Asymptotic Analysis 17:00 | |||
DS Videos: 5b. Big oh and Big omega Asymptotic Notations 39:00 | |||
DS Videos: 5c. Theta Asymptotic notation 13:00 | |||
DS Videos: 5d. What is Asymptotic comparison | how LOG works | rice grain story 31:00 | |||
DS Videos: 5e. Comparing Different Functions Asymptotically 53:00 | |||
DS Videos: 5f. Little Oh Little Omega | Properties of asymptotic notation | Stirling approximation 36:00 | |||
DS Videos: 6a.Formal set notation of Asymptote symbols 7:00 | |||
DS Videos: 6b. Asymptotic Notations GATE PYQs 1994, 96, 2000,1,3,4,8,11,17 21:00 | |||
DS Videos: 6c. Analysing the loops time complexity 29:00 | |||
6d. Time Complexity of loops -2 17:00 | |||
Annotated Notes: Lecture 5, 6 - Asymptotic Analysis (172 pages) | |||
Practice Set Loop Complexities (43 pages) | |||
LIVE: Loop Time Complexity Practice Set Discussion | |||
LIVE Session Loop Time Complexity Annotated Notes (69 pages) | |||
DS Videos: 7a. Brief about Best Case, Worst Case 22:00 | |||
DS Videos: 7b. More about Best Case, Worst Case 26:00 | |||
DS Videos: 7c. Questions on Algorithmic notations 5:00 | |||
Annotated Notes Lecture 7 (39 pages) | |||
Practice Set Asymptotic Notations (83 pages) | |||
LIVE: Asymptotic Notations Practice Set Discussion -1 | |||
LIVE: Asymptotic Notations Practice Set Discussion-2 | |||
LIVE Session Asymptotic Notations Annotated Notes (139 pages) | |||
Time Complexity of Recursive Programs | |||
2a. Introduction to recurrence relations 15:00 | |||
2b. Solving recurrence using Iteration Method 9:00 | |||
2c. More Examples of Iteration Method 10:00 | |||
3a. Solving recurrence using Tree Method 24:00 | |||
3b. More Examples Tree Method 16:00 | |||
3c. Even More Examples Tree Method 5:00 | |||
3d. More Examples Tree Method 12:00 | |||
4a. Masters Theorem Idea and examples 27:00 | |||
4b. Examples On Master Theorem 4:00 | |||
4c. Proof of Master Theorem 16:00 | |||
5a. Generalised Master Theorem 6:00 | |||
5b. [Optional but watch] Extended Master Theorem 15:00 | |||
5c. Various Examples of Master Theorem 7:00 | |||
5d. Problems that master theorem can not solve 5:00 | |||
6a. Introduction to change to variable method 15:00 | |||
6b. Examples on Change of Variable 12:00 | |||
6c. Few more examples on change of variable method 5:00 | |||
6d. Some More variation 17:00 | |||
Annotated Notes Module 1 Solving Reccurance relation (221 pages) | |||
Divide and Conquer Algorithms (Part-1) | |||
7a. Introduction to Divide and Conquer Algorithm 24:00 | |||
7b. Maximum of an array using D and C 10:00 | |||
7c. Example 2- Sum of an array 5:00 | |||
7d. Example 3- Search in an array 6:00 | |||
7e. Example 4 - Dumb Sort 8:00 | |||
A Note: Viewing Recurrence as Induction | |||
8a. Introduction to Merge Sort algorithm 11:00 | |||
8b.Heart of Merge Sort- Merge Procedure 16:00 | |||
8c. Merge Procedure -2 23:00 | |||
8d. Merge Sort Recursive tree with example 13:00 | |||
8e. Merge Sort Analysis (Contd..) 21:00 | |||
9a. Merge Sort questions -1 11:00 | |||
9b. Merge Sort questions -2 14:00 | |||
9c. More Questions on Merge sort 26:00 | |||
10a. Iterative (or Bottom-up) Merge sort 11:00 | |||
10b. GATE 1999 question on Bottom up Merge Sort 2:00 | |||
10c. Time Complexity of Iterative Merge sort 17:00 | |||
10d. [Optional and Skip] Implementation of Iterative Merge sort 13:00 | |||
11a. Merging k sorted arrays Part 1 22:00 | |||
11b. Merging k sorted arrays Part 2 22:00 | |||
11d. Definition of Stable and In-place sorting 17:00 | |||
[DELETED] In Place and Space Complexity 5:00 | |||
Annotated Notes Divide and Conquer Algorithms (Part-1) (178 pages) | |||
Maximum and Minimum Of Numbers | |||
12a. Maximum and Second Max of an array 19:00 | |||
12b. Second maximum using Tournament Method 31:00 | |||
12c. [Optional] How to keep track for candidates of Second maximum 10:00 | |||
12d. Maximum and Minimum of an array 35:00 | |||
13a. Tournament Method and D&C for Max Min in an array 25:00 | |||
13b. Cormen questions 7:00 | |||
13c. GATE 2007, 2014, 2021 Questions 11:00 | |||
TIFR Question | |||
14a. Algorithm Analysis 31:00 | |||
14b. Questions on Algorithmic notations 5:00 | |||
Annotated Notes Maximum & Minimum and Algorithm Analysis (97 pages) | |||
Divide and Conquer Algorithms (Part-2) | |||
15a. Counting inversion with Netflix and Amazon Example 17:00 | |||
15b. Numerical questions on Counting Inversion 15:00 | |||
15c. Counting Inversions using BruteForce method 12:00 | |||
16a. Heart of counting Inversion 24:00 | |||
16b. Working Example of Counting Inversion using D and C 13:00 | |||
16c. Counting Inversion question 10:00 | |||
17a. Closest pair in 2 D 33:00 | |||
17b. Closest pair-2 18:00 | |||
17c. Exponent of a number 7:00 | |||
17d. Matrix Multiplication 21:00 | |||
18a. Introduction to Quick Sort 28:00 | |||
18b. Working Example of Quick Sort 30:00 | |||
18c. Quick sort Analysis and Randomised quick sort 40:00 | |||
18d. GATE 2014 question 11:00 | |||
18e. Questions on quick sort 23:00 | |||
18f. [Optional and Skip] Average case analysis of quick sort 5:00 | |||
19a. The Select algorithm 25:00 | |||
19b. Binary Search 28:00 | |||
Annotated notes Divide and Conquer part 2 (212 pages) | |||
Sorting Algorithms (selection, insertion, bubble, counting sort) | |||
20a .Bubble Sort 27:00 | |||
20b .Insertion Sort 24:00 | |||
20c .Bubble Sort and Insertion Sort 34:00 | |||
20d. Selection Sort and Heap Sort 37:00 | |||
20e. Decision Tree 52:00 | |||
20f. [Optional] Counting Sort and Radix Sort 34:00 | |||
Annotated Notes Sorting Algorithms (92 pages) | |||
Breadth First and Depth First search (BFS and DFS) | |||
21a. Introduction to Graphs | Adjacency List and Matrix 19:00 | |||
21b. intuition for graph search methods 24:00 | |||
21c. Introduction to DFS 23:00 | |||
21d. DFS Implementation (Recursive and explicit stack) and Time complexity 40:00 | |||
22a. DFS Parentheses Theorem | GATE 2006 | |||
22b. DFS Edge Classifications 27:00 | |||
22c. Questions on DFS Edge Classification 30:00 | |||
22d. [Optional] Back-edge and cycle question 18:00 | |||
23a. DFS Application 1- Cycles in graph 31:00 | |||
23b. GATE 2007 question on DAG finish time 21:00 | |||
23c. DFS Application 2 Topological sort | GATE 2014 19:00 | |||
23d. DFS Application 3 Articulation Point | GATE 2021 46:00 | |||
Please Rate us on course page | |||
24a. Introduction to BFS 28:00 | |||
24b. BFS few Observations(Properties) and BFS Edge Classification 37:00 | |||
25c. BFS Applications 29:00 | |||
Annotated Notes DFS BFS (302 pages) | |||
Shortest Paths Algorithms (Greedy Algorithms) | |||
26a. Introduction to Greedy Algorithms | Introduction and Intuitive proof of Dijkstra 56:00 | |||
26b. Dijkstra code and Working Example 1 17:00 | |||
26c. Dijkstra Working Example 2 15:00 | |||
26d. Dijkstra Working Example 3 10:00 | |||
27a. Dijkstra on negative weights 44:00 | |||
27b. Video From DS Course: Priority Queues 17:00 | |||
27c. Dijkstra Time Complexity 33:00 | |||
27d. Dijkstra Time Complexity on more variant data structures | Dijkstra Demo 10:00 | |||
28a. DAG Shortest Path | Shortest Path in Directed Acyclic Graph 17:00 | |||
28b. Intuition Behind Bellman Ford Algorithm 28:00 | |||
28c. Examples of Bellman Ford | Time complexity 36:00 | |||
28d. Bellman ford proof and Early termination 23:00 | |||
Annotated Notes Dijkstra, DAG Shortest Path Algo, and Bellman Ford (163 pages) | |||
Minimum Spanning Tree Algorithms (Greedy Algorithms) | |||
29a. Why Minimum Spanning Trees 22:00 | |||
29b. Cut and Cycle properties of MST 22:00 | |||
29c. Kruskal Algorithm 24:00 | |||
30a. Questions on MSTs 23:00 | |||
30b. Prims Algorithm 27:00 | |||
30c. Prims and Dijkstra Similarity 39:00 | |||
30d. Single Example for Prims and Dijkstra both | MST vs Shortest path on Same Graph 8:00 | |||
31a.Interesting Questions on MSTs | GATE 2000 | MIT Questions 31:00 | |||
31b. Two Most Popular Template Questions in MSTs | TIFR 2014 38:00 | |||
31c. Four Cases in MSTs | GATE 2020 58:00 | |||
(In Complete) Annotated Notes Spanning Trees (92 pages) | |||
Annotated Notes Spanning Tree (203 pages) | |||
Please Rate us on course page | |||
More Greedy Algorithms | |||
32a. Huffman Encoding Concept and Questions | Interesting Story 32:00 | |||
32b. Question on Huffman Encoding 3:00 | |||
32c. Huffman Encoding Time Complexity 7:00 | |||
32d. Nice Questions on Huffman Encoding 8:00 | |||
33a. Berkeley and MIT Questions on Huffman Encoding 7:00 | |||
33b. [Optional] Huffman Encoding Question Based on Tree Variance 25:00 | |||
33c. Optimal Merge Pattern 5:00 | |||
34a. Interval Scheduling Problem (Activity Selection Problem) Algorithm Ideas 36:00 | |||
34b. Interval Scheduling Problem Algorithm 8:00 | |||
34c. [Optional] Proving Optimality using Exchange Techniques 24:00 | |||
34d. Other Variants of Interview Scheduling 11:00 | |||
34e. Job Scheduling With Deadlines 15:00 | |||
35a.Fractional Knapsack 27:00 | |||
35b. [Optional] Fractional Knapsack in O(n) 12:00 | |||
Annotated Notes Huffman Encoding and Optimal Merge Pattern (56 pages) | |||
Annotated Notes Interval Scheduling Problem, Job Scheduling With Deadline, Fractional Knapsack (53 pages) | |||
Dynamic Programming | |||
36a.Introduction to DP | Two Approaches | Why we call it "Dynamic" 31:00 | |||
36b. Example 1- Climbing Stairs 9:00 | |||
36c. Example 2 MCQ on DP 10:00 | |||
36d. Example 3- Climbing Stairs Cost 11:00 | |||
37a. Example 4- One Nice question on Total Probability and DP 22:00 | |||
37b. Order of Table Filling | MIT Questions | Top Down vs Bottom Up Difference 23:00 | |||
37c. DP vs Divide and Conquer | Elements in DP 23:00 | |||
38a. Longest Common Subsequence | BruteForce Method 26:00 | |||
38b. Longest Common Subsequence using Dynamic Programming 35:00 | |||
38c. Total Calls vs Unique Calls in LCS 8:00 | |||
38d. GATE 2009 Easy Question 1:00 | |||
39a. Running Example on LCS 27:00 | |||
39b. GATE 2014 Question on LCS 4:00 | |||
39c. LCS Applications 1:00 | |||
39d. [Optional] Another way of writting LCS Recursion 13:00 | |||
40a. Introduction to Matrix Chain Multiplication 38:00 | |||
40b. Number of Ways to Multiply n Matrices 10:00 | |||
40c. Recursive Formulation of Matrix Chain Multiplication and GATE 2016 Question 51:00 | |||
40d.Example on Matrix Chain Multiplication 9:00 | |||
40e. Time Complexity of Matrix chain Multiplication 14:00 | |||
41a. Greedy Strategy on 0-1 Knapsack Problem 15:00 | |||
41b. Recursive Formulation of 0-1 Knapsack and Example 23:00 | |||
41c. One More Running Example on 0-1 Knapsack 8:00 | |||
41d. Total Calls in Knapsack, Unique Calls in Knapsack, and Time Complexity 10:00 | |||
41e. Solving 0-1 Knapsack with Bottom Up Approach 18:00 | |||
Annotated Notes Introduction to DP (60 pages) | |||
Annotated Notes Longest Common Subsequence (47 pages) | |||
Annotated Notes Matrix Chain and 0-1 Knapsack (72 pages) | |||
Please Rate us on course page | |||
More Dynamic Programming Algorithms | |||
42a. Subset Sum Problem 29:00 | |||
42b. Coin Change Problem 13:00 | |||
42c. DP Vs Greedy vs Divide and Conquer 23:00 | |||
42d. Floyd Warshall Algorithm 15:00 | |||
42e. Travelling Salesman 6:00 | |||
Annotated Notes More Dynamic Programming Algorithms (30 pages) | |||
Students' Hand Written Notes | |||
Algorithms Notes - By Quantum City (48 pages) | |||
Revision and Practice Sessions | |||
Asymptotic Notations in Algorithms with ALL GATE PYQs | Revision and Practice | O(), o(), Ω(), ω() | |||
Annotated Notes -1 Revision and Practice Asymptotic Notations (240 pages) | |||
Solving Recurrence Relations and Loop Time Complexities with ALL GATE PYQs | Revision and Practice | |||
Annotated Notes -2 Reccurrance Relations Practice (219 pages) | |||
DFS and its Applications and ALL GATE PYQs | Revision and Practice Session | Algorithms | Graph | |||
Annotated Notes -3 Revision and Practice DFS (226 pages) | |||
BFS and Dijkstra and GATE PYQs | Revision and Practice Session | Algorithms | Graph | |||
Annotated Notes -4 Revision and Practice BFS Dijkstra (133 pages) | |||
Prims and Kruskal's and GATE PYQs | Revision and Practice Session | Algorithms | Graph | |||
Annotated Notes -5 Revision and Practice Prims and Kruskals (247 pages) | |||
Bellman-Ford Proof | Most Intuitive Proof WITHOUT Induction | GATE CSE and DA | Sachin Mittal | |||
Annotated Notes -6 Revision and Practice Bellman-Ford Proof and Questions (99 pages) | |||
Students' Hand Written Notes | |||
Handwritten Notes by Karan Agrawal (AIR 102 GATE CS 2024)- Algorithms | |||
Notes by Quantum City (AIR 107, GATE CS 2024, Shreyas Rathod) - Algorithms Notes (51 pages) |
After successful purchase, this item would be added to your courses.
You can access your courses in the following ways :