Design and Analysis of Algorithms (Hindi) (Part 1)

   Saturday, May 04, 2024   

Starting a new Lecture Notes Series on Design and Analysis of Algorithms

Youtube Lecture Playlist Credits 

Channel Name: THE GATEHUB

So Let Us Start to This Journey of Learning 

Design and Analysis of Algorithms By Lecture Notes together!

Lecture 1: Introduction to Algorithm and Properties | GATECSE | DAA

Lecture 2: Analysis of Algorithms || Time Complexity Analysis || DAA

Lecture 3: Comparing of various functions to analyze time complexity | DAA

Lecture 4: Big O Notation | Asymptotic Notation | GATECSE | DAA

Lecture 5: Big Omega Notation | Asymptotic Notation | GATECSE | DAA

Lecture 6: Theta Notation | Asymptotic Notation | GATECSE | DAA

Lecture 7: Small o Notation | Asymptotic Notation | GATECSE | DAA

Lecture 8: Small omega notation | Asymptotic Notation | GATECSE | DAA

Lecture 9: Upper Bound Lower Bound and Average Bound in Asymptotic Notation | GATECSE | DAA

Lecture 10: Asymptotic Notation Solved Examples Part-1 | GATE Solved Examples | GATECSE | DAA

Lecture 11: Asymptotic Notation Solved Examples Part-2 | GATE Solved Examples | GATECSE | DAA

Lecture 12: Properties of Asymptotic Notations | Big O | Big omega | Theta | GATECSE | DAA

Lecture 13: Asymptotic Notation Solved Examples Part-3 | GATE Solved Examples | GATECSE | DAA

Lecture 14: Asymptotic Notation Solved Examples Part-4 | GATE Solved Examples | GATECSE | DAA

Lecture 15: Asymptotic Notation Solved Examples Part-5 | GATE Solved Examples | GATECSE | DAA

Lecture 16: Best Case, Average Case and Worst Case Time Complexity of an Algorithm | GATECSE | DAA

Lecture 17: Time complexity Analysis of Iterative Algorithms | Part-1| GATECSE | DAA

Lecture 18: Time complexity Analysis of Iterative Algorithms | Part-2 | GATECSE | DAA

Lecture 19: Time complexity Analysis of Iterative Algorithms | Part-3 | GATECSE | DAA

Lecture 20: Time complexity Analysis of Iterative Algorithms | Part-4 | GATECSE | DAA

Lecture 21: Time complexity Analysis of Iterative Algorithms | Part-5 | GATECSE | DAA

Lecture 22: Recurrence Relation T(n)=T(n/2) + C | What is Recurrence Relation | GATECSE | DAA

Lecture 23: Recurrence Relation T(n) = T(n-1) + C | Substitution Method | Finding Factorial | GATECSE | DAA

Lecture 24: Recurrence Relation T(n)=2T(n/2)+n | Substitution Method | GATECSE | DAA

Lecture 25: Recurrence Relation T(n)=8T(n/2)+n^2 | Substitution Method | GATECSE | DAA

Lecture 26: Recurrence Relation T(n)=2T(n/2)+nlogn | Substitution Method | GATECSE | DAA

Lecture 27: Recurrence Relation T(n)=2T(n/2)+n/logn | Substitution Method | GATECSE | DAA

Lecture 28: Recurrence Relation T(n)=2T(√n)+C | Substitution Method | GATECSE | DAA

Lecture 29: Recurrence Relation T(n)=2T(√n)+log n | Substitution Method | GATECSE | DAA

Lecture 30: Recurrence Relation T(n)=√2T(n/2)+√n | Substitution Method | GATECSE | DAA

Lecture 31: Master's Theorem | Solving Recurrences | The Master's Methods | GATECSE | DAA

Lecture 32: Recurrence Relations T(n)=T(√n)+logn Using Master's Theorem | GATECSE | DAA

Lecture 33: Divide and Conquer in Algorithms | GATECSE | DAA

Lecture 34: Recurrence Relation T(n)= 2T(n/2) +n | Recursive Tree Method | GATECSE | DAA

Lecture 35: Recurrence Relation T(n)= 5T(n/5) +n | Recursive Tree Method | GATECSE | DAA

Lecture 36: Recurrence Relation T(n)= 3T(n/4) +n^2 | Recursive Tree Method | GATECSE | DAA

Lecture 37: Recurrence Relation T(n)= T(n/3) + T(2n/3) + cn | Recursive Tree Method | GATECSE | DAA

Lecture 38: Recurrence Relation T(n)= T(n/10) + T(9n/10) + cn | Recursive Tree Method | GATECSE | DAA

Lecture 39: Finding Maximum and Minimum element using Divide and Conquer | GATECSE | DAA

Lecture 40: Mergesort Algorithm (Part-1) | Merging | Merge Procedure | Sorting Algorithm | GATECSE | DAA

Lecture 41: Mergesort Algorithm (Part-2) | | Divide and Conquer | Sorting Algorithm | GATECSE | DAA

Lecture 42: Mergesort Algorithm (Part-3) | Time and Space Complexity | Sorting Algorithm | GATECSE | DAA

Lecture 43: Mergesort Solved Example (Part-1) | GATE Solved Examples | GATECSE | DAA

Lecture 44: Quick Sort Algorithm | Divide and Conquer | GATECSE | DAA

Lecture 45: Quicksort Time and Space Complexity | Quicksort Analysis | Best Case | Worst Case | GATECSE | DAA

Lecture 46: Quicksort Solved Example (Part-1) | GATE Solved Examples | GATECSE | DAA

Lecture 47: Quicksort Solved Example (Part-2) | GATE Solved Examples | GATECSE | DAA

Lecture 48: Quicksort Solved Example (Part-3) | GATE Solved Examples | GATECSE | DAA

Lecture 49: Randomized Quicksort Algorithm | Divide and Conquer | GATECSE | DAA

Lecture 50: Strassen’s Matrix Multiplication | GATECSE | DAA

Lecture 51: Introduction to Heap | Heap Tree with examples | Heapsort | GATECSE | DAA

Lecture 52: Max Heap and Min Heap | Min Heap Tree | Max Heap Tree | Heapsort | GATECSE | DAA

Lecture 53: Heapify Algorithm | Time Complexity of Max Heapify Algorithm | GATECSE | DAA

Lecture 54: Build Max Heap | Build Max Heap Time Complexity | Heap | GATECSE | DAA

Lecture 55: Max Heap and Min Heap | Min Heap Tree | Max Heap Tree | Heapsort | GATECSE | DAA

Lecture 56: Heapify Algorithm | Time Complexity of Max Heapify Algorithm | GATECSE | DAA

Lecture 57: Build Max Heap | Build Max Heap Time Complexity | Heap | GATECSE | DAA