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

   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 58: Heapsort Solved Examples (Part 2) Practice Problems Heapsort GATECSE DAA

Lecture 59: Heapsort Solved Examples (Part 3) | Practice Problems | Heapsort | GATECSE | DAA

Lecture 60: Heapsort Solved Examples (Part 4) | Practice Problems | Heapsort | GATECSE | DAA

Lecture 61: 3 ary Max Heap | K-ary Heap | Heapsort | GATECSE | DAA

Lecture 62: Priority Queue | Insertion and Deletion in Priority Queue | GATECSE | DAA

Lecture 63: Binomial Heap and Binomial Tree | Properties of Binomial Tree | DAA

Lecture 64: Properties of Binomial Heap | Structure of Binomial Heap | Binomial Heap | DAA

Lecture 65: Binomial Heap Union Operation with Time Complexity | Operation on Binomial Heap | DAA

Lecture 66: Binomial Heap Insertion Operation | Inserting a node into Binomial Heap | DAA

Lecture 67: Properties of Binomial Heap | Structure of Binomial Heap | Binomial Heap | DAA

Lecture 68: Binomial Heap Union Operation with Time Complexity | Operation on Binomial Heap | DAA

Lecture 69: Binomial Heap Insertion Operation | Inserting a node into Binomial Heap | DAA

Lecture 70: Fibonacci Heap Operations | Create Fibonacci Heap| Inserting node| Finding Minimum | Union | DAA

Lecture 71: Fibonacci Heap Operations| Extract min in Fibonacci heap | Delete min in Fibonacci heap | DAA

Lecture 72: Fibonacci Heap Deletion Operation | Deleting a node from Fibonacci Heap | DAA

Lecture 73: Introduction to Greedy Method | Greedy Algorithms | GATECSE | DAA

Lecture 74: Knapsack Problem using Greedy Method (Part-1) | Fractional Knapsack Problem | GATECSE | DAA

Lecture 75: Knapsack Problem using Greedy Method (Part-2) | Fractional Knapsack Problem | GATECSE | DAA

Lecture 76: Job Sequencing with Deadline Using Greedy Method | GATECSE | DAA

Lecture 77: Huffman Coding Algorithm with Example | Greedy Techniques | GATECSE | DAA

Lecture 78: Huffman Coding Algorithm with Example | Greedy Techniques | GATECSE | DAA

Lecture 79: Huffman Coding Algorithm with Example | Greedy Techniques | GATECSE | DAA

Lecture 80: Optimal Merge Pattern | Greedy Method | GATECSE | DAA

Lecture 81: Spanning Tree | Minimum Cost Spanning Tree | GATECSE | DAA

Lecture 82: Huffman Coding Algorithm with Example | Greedy Techniques | GATECSE | DAA

Lecture 83: Optimal Merge Pattern | Greedy Method | GATECSE | DAA

Lecture 84: Spanning Tree | Minimum Cost Spanning Tree | GATECSE | DAA

Lecture 85: Prims And Kruskal Solved Examples (Part-1) | Minimum Cost Spanning Tree | GATECSE | DAA

Lecture 86: Prims And Kruskal Solved Examples (Part-2) | Minimum Cost Spanning Tree | GATECSE | DAA

Lecture 87: Prims And Kruskal Solved Examples (Part-3) | Minimum Cost Spanning Tree | GATECSE | DAA

Lecture 88: Prims And Kruskal Solved Examples (Part-4) | Minimum Cost Spanning Tree | GATECSE | DAA

Lecture 89: Dijkstra Algorithm | Single Source Shortest Path | Greedy Method | GATECSE | DAA

Lecture 90: Why Dijkstra Algorithm Fails | Dijkstra Algorithm Drawback | Greedy Method | GATECSE | DAA

Lecture 91: Dijkstra's Algorithm Time Complexity | Dijkstra's Algorithm Analysis | GATECSE | DAA

Lecture 92: Dijkstra's Algorithm Solved Examples | Practice Problem | Greedy Method | GATECSE | DAA

Lecture 93: Bellman Ford Algorithm | bellman ford algorithm shortest path | GATECSE | DAA

Lecture 94: Bellman Ford Algorithm Solved Example | bellman ford algorithm shortest path | GATECSE | DAA

Lecture 95: Bellman Ford Algorithm Time Complexity | GATECSE | DAA

Lecture 96: Introduction to Dynamic Programming | How to Use DP | GATECSE | DAA

Lecture 97: Why Greedy Algorithm fails in 0/1 knapsack problem | Dynamic Programming | GATECSE | DAA

Lecture 98: 0/1 Knapsack Problem using Dynamic Programming | Recursive Equation | GATECSE | DAA

Lecture 99: Introduction to All pair Shortest Path | Floyd-Warshall Algorithm | Dynamic Programming | DAA

Lecture 100: All Pair Shortest Path | Floyd-Warshall Algorithm | Dynamic Programming | GATECSE | DAA

Lecture 101: Floyd-Warshall Algorithm Time Complexity | All Pair Shortest Path | Dynamic Programming | DAA

Lecture 102: Multistage Graph using Dynamic Programming | GATECSE | DAA

Lecture 103: Longest Common Subsequence Using Dynamic Programming | GATECSE | DAA

Lecture 104: Longest Common Sequence Solved Example | Dynamic Programming | GATECSE | DAA

Lecture 105: Travelling Salesman Problem using Dynamic Programming | GATECSE | DAA

Lecture 106: Sum of Subset Problem using Dynamic Programming | GATECSE | DAA

Lecture 107: Matrix Chain Multiplication using Dynamic Programming | GATECSE | DAA

Lecture 108: Matrix Chain Multiplication Solved Example | Dynamic Programming | GATECSE | DAA

Lecture 109: Introduction to Backtracking | Backtracking Algorithm | DAA

Lecture 110: N Queen Problem Using Backtracking | N Queen Problem | Backtracking Algorithm | DAA

Lecture 111: Sum of Subset Problem Using Backtracking || Backtracking Algorithm || DAA

Lecture 112: Graph Coloring Problem Using Backtracking || Backtracking Algorithm || DAA

Lecture 113: Hamiltonian Cycle Using Backtracking || Backtracking Algorithm || DAA

Lecture 114: 0/1 Knapsack Problem Using Backtracking || Backtracking Algorithm || DAA