label_important Time Complexity of Recursive Programs

ondemand_video 2a. Introduction to recurrence relations 15:00

ondemand_video 2b. Solving recurrence using Iteration Method 9:00

Description Course Content How to Use ondemand_video 2c. More Examples of Iteration Method 10:00
ondemand_video 3a. Solving recurrence using Tree Method 24:00
label_important Why Study Algorithms ondemand_video 3b. More Examples Tree Method 16:00
ondemand_video 1a. Why Study Algorithms 13:00 ondemand_video 3c. Even More Examples Tree Method 5:00
ondemand_video 1b.An algorithm that changed history And Child's algorithm 9:00 ondemand_video 3d. More Examples Tree Method 12:00
label_important Asymptotic Analysis and Loop Complexities (DS Course Videos) ondemand_video 4a. Masters Theorem Idea and examples 27:00
ondemand_video DS Videos: 5a. Introduction to Asymptotic Analysis 17:00 ondemand_video 4b. Examples On Master Theorem 4:00
ondemand_video DS Videos: 5b. Big oh and Big omega Asymptotic Notations 39:00 ondemand_video 4c. Proof of Master Theorem 16:00
ondemand_video DS Videos: 5c. Theta Asymptotic notation 13:00 ondemand_video 5a. Generalised Master Theorem 6:00
ondemand_video DS Videos: 5d. What is Asymptotic comparison | how LOG works | rice grain story 31:00 ondemand_video 5b. [Optional but watch] Extended Master Theorem 15:00
ondemand_video DS Videos: 5e. Comparing Different Functions Asymptotically 53:00 ondemand_video 5c. Various Examples of Master Theorem 7:00
ondemand_video DS Videos: 5f. Little Oh Little Omega | Properties of asymptotic notation | Stirling approximation 36:00 ondemand_video 5d. Problems that master theorem can not solve 5:00
ondemand_video DS Videos: 6a.Formal set notation of Asymptote symbols 7:00 ondemand_video 6a. Introduction to change to variable method 15:00
ondemand_video DS Videos: 6b. Asymptotic Notations GATE PYQs 1994, 96, 2000,1,3,4,8,11,17 21:00 ondemand_video 6b. Examples on Change of Variable 12:00
ondemand_video DS Videos: 6c. Analysing the loops time complexity 29:00 ondemand_video 6c. Few more examples on change of variable method 5:00
ondemand_video 6d. Time Complexity of loops -2 17:00 ondemand_video 6d. Some More variation 17:00
picture_as_pdf Annotated Notes: Lecture 5, 6 - Asymptotic Analysis (172 pages) picture_as_pdf Annotated Notes Module 1 Solving Reccurance relation (221 pages)
picture_as_pdf Practice Set Loop Complexities (43 pages) label_important Divide and Conquer Algorithms (Part-1)
description LIVE: Loop Time Complexity Practice Set Discussion ondemand_video 7a. Introduction to Divide and Conquer Algorithm 24:00
picture_as_pdf LIVE Session Loop Time Complexity Annotated Notes (69 pages) ondemand_video 7b. Maximum of an array using D and C 10:00
ondemand_video DS Videos: 7a. Brief about Best Case, Worst Case 22:00 ondemand_video 7c. Example 2- Sum of an array 5:00
ondemand_video DS Videos: 7b. More about Best Case, Worst Case 26:00 ondemand_video 7d. Example 3- Search in an array 6:00
ondemand_video DS Videos: 7c. Questions on Algorithmic notations 5:00 ondemand_video 7e. Example 4 - Dumb Sort 8:00
picture_as_pdf Annotated Notes Lecture 7 (39 pages) description A Note: Viewing Recurrence as Induction
picture_as_pdf Practice Set Asymptotic Notations (83 pages) ondemand_video 8a. Introduction to Merge Sort algorithm 11:00
live_tv LIVE: Asymptotic Notations Practice Set Discussion -1 ondemand_video 8b.Heart of Merge Sort- Merge Procedure 16:00
live_tv LIVE: Asymptotic Notations Practice Set Discussion-2 ondemand_video 8c. Merge Procedure -2 23:00
picture_as_pdf LIVE Session Asymptotic Notations Annotated Notes (139 pages) ondemand_video 8d. Merge Sort Recursive tree with example 13:00

ondemand_video 8e. Merge Sort Analysis (Contd..) 21:00 ondemand_video 16c. Counting Inversion question 10:00
ondemand_video 9a. Merge Sort questions -1 11:00 ondemand_video 17a. Closest pair in 2 D 33:00
ondemand_video 9b. Merge Sort questions -2 14:00 ondemand_video 17b. Closest pair-2 18:00
ondemand_video 9c. More Questions on Merge sort 26:00 ondemand_video 17c. Exponent of a number 7:00
ondemand_video 10a. Iterative (or Bottom-up) Merge sort 11:00 ondemand_video 17d. Matrix Multiplication 21:00
ondemand_video 10b. GATE 1999 question on Bottom up Merge Sort 2:00 ondemand_video 18a. Introduction to Quick Sort 28:00
ondemand_video 10c. Time Complexity of Iterative Merge sort 17:00 ondemand_video 18b. Working Example of Quick Sort 30:00
ondemand_video 10d. [Optional and Skip] Implementation of Iterative Merge sort 13:00 ondemand_video 18c. Quick sort Analysis and Randomised quick sort 40:00
ondemand_video 11a. Merging k sorted arrays Part 1 22:00 ondemand_video 18d. GATE 2014 question 11:00
ondemand_video 11b. Merging k sorted arrays Part 2 22:00 ondemand_video 18e. Questions on quick sort 23:00
ondemand_video 11d. Definition of Stable and In-place sorting 17:00 ondemand_video 18f. [Optional and Skip] Average case analysis of quick sort 5:00
ondemand_video [DELETED] In Place and Space Complexity 5:00 ondemand_video 19a. The Select algorithm 25:00
picture_as_pdf Annotated Notes Divide and Conquer Algorithms (Part-1) (178 pages) ondemand_video 19b. Binary Search 28:00
label_important Maximum and Minimum Of Numbers picture_as_pdf Annotated notes Divide and Conquer part 2 (212 pages)
ondemand_video 12a. Maximum and Second Max of an array 19:00 label_important Sorting Algorithms (selection, insertion, bubble, counting sort)
ondemand_video 12b. Second maximum using Tournament Method 31:00 ondemand_video 20a .Bubble Sort 27:00
ondemand_video 12c. [Optional] How to keep track for candidates of Second maximum 10:00 ondemand_video 20b .Insertion Sort 24:00
ondemand_video 12d. Maximum and Minimum of an array 35:00 ondemand_video 20c .Bubble Sort and Insertion Sort 34:00
ondemand_video 13a. Tournament Method and D&C for Max Min in an array 25:00 ondemand_video 20d. Selection Sort and Heap Sort 37:00
ondemand_video 13b. Cormen questions 7:00 ondemand_video 20e. Decision Tree 52:00
ondemand_video 13c. GATE 2007, 2014, 2021 Questions 11:00 ondemand_video 20f. [Optional] Counting Sort and Radix Sort 34:00
description TIFR Question picture_as_pdf Annotated Notes Sorting Algorithms (92 pages)
ondemand_video 14a. Algorithm Analysis 31:00 label_important Breadth First and Depth First search (BFS and DFS)
ondemand_video 14b. Questions on Algorithmic notations 5:00 ondemand_video 21a. Introduction to Graphs | Adjacency List and Matrix 19:00
picture_as_pdf Annotated Notes Maximum & Minimum and Algorithm Analysis (97 pages) ondemand_video 21b. intuition for graph search methods 24:00
label_important Divide and Conquer Algorithms (Part-2) ondemand_video 21c. Introduction to DFS 23:00
ondemand_video 15a. Counting inversion with Netflix and Amazon Example 17:00 ondemand_video 21d. DFS Implementation (Recursive and explicit stack) and Time complexity 40:00
ondemand_video 15b. Numerical questions on Counting Inversion 15:00 ondemand_video 22a. DFS Parentheses Theorem | GATE 2006
ondemand_video 15c. Counting Inversions using BruteForce method 12:00 ondemand_video 22b. DFS Edge Classifications 27:00
ondemand_video 16a. Heart of counting Inversion 24:00 ondemand_video 22c. Questions on DFS Edge Classification 30:00
ondemand_video 16b. Working Example of Counting Inversion using D and C 13:00 ondemand_video 22d. [Optional] Back-edge and cycle question 18:00
 ondemand_video 23a. DFS Application 1- Cycles in graph 31:00 ondemand_video 31a.Interesting Questions on MSTs | GATE 2000 | MIT Questions 31:00
ondemand_video 23b. GATE 2007 question on DAG finish time 21:00 ondemand_video 31b. Two Most Popular Template Questions in MSTs | TIFR 2014 38:00
ondemand_video 23c. DFS Application 2 Topological sort | GATE 2014 19:00 ondemand_video 31c. Four Cases in MSTs | GATE 2020 58:00
ondemand_video 23d. DFS Application 3 Articulation Point | GATE 2021 46:00 picture_as_pdf (In Complete) Annotated Notes Spanning Trees (92 pages)
description Please Rate us on course page picture_as_pdf Annotated Notes Spanning Tree (203 pages)
ondemand_video 24a. Introduction to BFS 28:00 description Please Rate us on course page
ondemand_video 24b. BFS few Observations(Properties) and BFS Edge Classification 37:00 label_important More Greedy Algorithms
ondemand_video 25. BFS Applications 29:00 ondemand_video 32a. Huffman Encoding Concept and Questions | Interesting Story 32:00
picture_as_pdf Annotated Notes DFS BFS (302 pages) ondemand_video 32b. Question on Huffman Encoding 3:00
label_important Shortest Paths Algorithms (Greedy Algorithms) ondemand_video 32c. Huffman Encoding Time Complexity 7:00
ondemand_video 26a. Introduction to Greedy Algorithms | Introduction and Intuitive proof of Dijkstra 56:00 ondemand_video 32d. Nice Questions on Huffman Encoding 8:00
ondemand_video 26b. Dijkstra code and Working Example 1 17:00 ondemand_video 33a. Berkeley and MIT Questions on Huffman Encoding 7:00
ondemand_video 26c. Dijkstra Working Example 2 15:00 ondemand_video 33b. [Optional] Huffman Encoding Question Based on Tree Variance 25:00
ondemand_video 26d. Dijkstra Working Example 3 10:00 ondemand_video 33c. Optimal Merge Pattern 5:00
ondemand_video 27a. Dijkstra on negative weights 44:00 ondemand_video 34a. Interval Scheduling Problem (Activity Selection Problem) Algorithm Ideas 36:00
ondemand_video 27b. Video From DS Course: Priority Queues 17:00 ondemand_video 34b. Interval Scheduling Problem Algorithm 8:00
ondemand_video 27c. Dijkstra Time Complexity 33:00 ondemand_video 34c. [Optional] Proving Optimality using Exchange Techniques 24:00
ondemand_video 27d. Dijkstra Time Complexity on more variant data structures | Dijkstra Demo 10:00 ondemand_video 34d. Other Variants of Interview Scheduling 11:00
ondemand_video 28a. DAG Shortest Path | Shortest Path in Directed Acyclic Graph 17:00 ondemand_video 34e. Job Scheduling With Deadlines 15:00
ondemand_video 28b. Intuition Behind Bellman Ford Algorithm 28:00 ondemand_video 35a.Fractional Knapsack 27:00
ondemand_video 28c. Examples of Bellman Ford | Time complexity 36:00 ondemand_video 35b. [Optional] Fractional Knapsack in O(n) 12:00
ondemand_video 28d. Bellman ford proof and Early termination 23:00 picture_as_pdf Annotated Notes Huffman Encoding and Optimal Merge Pattern (56 pages)
picture_as_pdf Annotated Notes Dijkstra, DAG Shortest Path Algo, and Bellman Ford (163 pages) picture_as_pdf Annotated Notes Interval Scheduling Problem, Job Scheduling With Deadline, Fractional Knapsack (53 pages)
label_important Minimum Spanning Tree Algorithms (Greedy Algorithms) label_important Dynamic Programming
ondemand_video 29a. Why Minimum Spanning Trees 22:00 ondemand_video 36a.Introduction to DP | Two Approaches | Why we call it "Dynamic" 31:00
ondemand_video 29b. Cut and Cycle properties of MST 22:00 ondemand_video 36b. Example 1- Climbing Stairs 9:00
ondemand_video 29c. Kruskal Algorithm 24:00 ondemand_video 36c. Example 2 MCQ on DP 10:00
ondemand_video 30a. Questions on MSTs 23:00 ondemand_video 36d. Example 3- Climbing Stairs Cost 11:00
ondemand_video 30b. Prims Algorithm 27:00 ondemand_video 37a. Example 4- One Nice question on Total Probability and DP 22:00
ondemand_video 30c. Prims and Dijkstra Similarity 39:00 ondemand_video 37b. Order of Table Filling | MIT Questions | Top Down vs Bottom Up Difference 23:00
ondemand_video 30d. Single Example for Prims and Dijkstra both | MST vs Shortest path on Same Graph 8:00 ondemand_video 37c. DP vs Divide and Conquer | Elements in DP 23:00

ondemand_video 38a. Longest Common Subsequence | BruteForce Method 26:00 label_important Revision and Practice Sessions
ondemand_video 38b. Longest Common Subsequence using Dynamic Programming 35:00 description Asymptotic Notations in Algorithms with ALL GATE PYQs | Revision and Practice | O(), o(), Ω(), ω()
ondemand_video 38c. Total Calls vs Unique Calls in LCS 8:00 picture_as_pdf Annotated Notes -1 Revision and Practice Asymptotic Notations (240 pages)
ondemand_video 38d. GATE 2009 Easy Question 1:00 description Solving Recurrence Relations and Loop Time Complexities with ALL GATE PYQs | Revision and Practice
ondemand_video 39a. Running Example on LCS 27:00 picture_as_pdf Annotated Notes -2 Reccurrance Relations Practice (219 pages)
ondemand_video 39b. GATE 2014 Question on LCS 4:00 description DFS and its Applications and ALL GATE PYQs | Revision and Practice Session | Algorithms | Graph
ondemand_video 39c. LCS Applications 1:00 picture_as_pdf Annotated Notes -3 Revision and Practice DFS (226 pages)
ondemand_video 39d. [Optional] Another way of writting LCS Recursion 13:00 description BFS and Dijkstra and GATE PYQs | Revision and Practice Session | Algorithms | Graph
ondemand_video 40a. Introduction to Matrix Chain Multiplication 38:00 picture_as_pdf Annotated Notes -4 Revision and Practice BFS Dijkstra (133 pages)
ondemand_video 40b. Number of Ways to Multiply n Matrices 10:00 description Prims and Kruskal's and GATE PYQs | Revision and Practice Session | Algorithms | Graph
ondemand_video 40c. Recursive Formulation of Matrix Chain Multiplication and GATE 2016 Question 51:00 picture_as_pdf Annotated Notes -5 Revision and Practice Prims and Kruskals (247 pages)
ondemand_video 40d.Example on Matrix Chain Multiplication 9:00 description Bellman-Ford Proof | Most Intuitive Proof WITHOUT Induction | GATE CSE and DA | Sachin Mittal
ondemand_video 40e. Time Complexity of Matrix chain Multiplication 14:00 picture_as_pdf Annotated Notes -6 Revision and Practice Bellman-Ford Proof and Questions (99 pages)
ondemand_video 41a. Greedy Strategy on 0-1 Knapsack Problem 15:00 label_important Students' Hand Written Notes
ondemand_video 41b. Recursive Formulation of 0-1 Knapsack and Example 23:00 description Handwritten Notes by Karan Agrawal (AIR 102 GATE CS 2024)- Algorithms
ondemand_video 41c. One More Running Example on 0-1 Knapsack 8:00 picture_as_pdf Notes by Quantum City (AIR 107, GATE CS 2024, Shreyas Rathod) - Algorithms Notes (51 pages)
ondemand_video 41d. Total Calls in Knapsack, Unique Calls in Knapsack, and Time Complexity 10:00 label_important LIVE Sessions
ondemand_video 41e. Solving 0-1 Knapsack with Bottom Up Approach 18:00 live_tv Session 1: PYQs on DFS BFS and Sorting
picture_as_pdf Annotated Notes Introduction to DP (60 pages) picture_as_pdf Annotated Notes Session 1 PYQs on DFS BFS and Sorting (38 pages)
picture_as_pdf Annotated Notes Longest Common Subsequence (47 pages)
picture_as_pdf

5.0
Annotated Notes Matrix Chain and 0-1 Knapsack (72 pages) Reviews
description Please Rate us on course page
5 52
label_important More Dynamic Programming Algorithms 4 1
3 0
ondemand_video 42a. Subset Sum Problem 29:00
star star star star star
2 0
1 0
ondemand_video 42b. Coin Change Problem 13:00 people 53 total

ondemand_video 42c. DP Vs Greedy vs Divide and Conquer 23:00

ME
ondemand_video 42d. Floyd Warshall Algorithm 15:00
star_borderstar_borderstar_borderstar_borderstar_border
ondemand_video 42e. Travelling Salesman 6:00 Write a review...
picture_as_pdf Annotated Notes More Dynamic Programming Algorithms (30 pages)
label_important Students' Hand Written Notes
picture_as_pdf Algorithms Notes - By Quantum City (48 pages) Post
A ANUJ SINGH FEATURED REVIEW
star star star star star 12 days ago
Simply awesome 💯
B BHANULATHA FEATURED REVIEW
star star star star star about a month ago
Thanks a Gigabyte for such high quality content...
S SHUBH FEATURED REVIEW
star star star star star about a month ago
An awesome & mind blowing Experience having sush a precise discussion & explanation across all topics ❤
J JAYCHANDRA DE FEATURED REVIEW
star star star star star 2 months ago
Excellent explanation even a novice can understand. Definitely one of the best courses for the subject of Algorithms.
A ANIKET SENGUPTA FEATURED REVIEW
star star star star star 2 months ago
I just want to say that the implementation of every concept was done amazingly. I know that implementation and direct programming is not part of the GATE curriculum,
but they were done in such a way that they helped in understanding the theory a lot!! Thanks sir for a crystal clear understanding of an amazing subject.

Load More Reviews

Other Courses

Terms of use Privacy policy About us FAQs Contact us  𝕏   

Refund policy Telegram Play Store