Design and Analysis of Algorithms(DAA) in Hindi
4.0
(1)
23 learners
What you'll learn
This course includes
- 26.3 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 101 lessons • 26.3 hours of video
Design and Analysis of Algorithms(DAA) in Hindi
101 lessons
• 26.3 hours
Design and Analysis of Algorithms(DAA) in Hindi
101 lessons
• 26.3 hours
- DAA2: Design And Analysis of Algorithms| Introduction to DAA | What is Algorithm| Characteristic 18:25
- DAA4: Analyzing Algorithms| Analysis of Algorithms| Time and Space |Worst, Best & Average case 09:21
- DAA5: Complexity of Algorithm | Time Complexity| Rules for calculating time complexity with example 13:23
- DAA6: Complexity of Algorithm | Time Complexity Examples | Rules for calculating time complexity 07:10
- DAA 7: Complexity of Algorithm | Space Complexity analysis | Tules for Space complexity 10:05
- DAA 8: Growth of Function in Algorithm| Asymptotic Notations|Big O Omega and Theta notation examples 21:51
- DAA38: B-Tree Definition| B Tree Properties | B Tree Explained In Hindi 12:26
- DAA40: B Tree Operations | B- Tree Search Algorithm | B Tree Seaching Examples 11:32
- DAA41: Creating an empty B-tree| Splitting a node in a B-tree|Inserting a key into a B-tree in hindi 11:54
- DAA42: B Tree insertion Solved example| B Tree Insertion Important Question 11:43
- DAA43: Delete Operation in B-Tree| B Tree Deletion Algorithm | B Tree Deletion process 10:34
- DAA44: Delete Operation in B-Tree| B Tree Deletion Solved Examples 08:44
- DAA63: Huffman Coding Algorithm| Huffman Coding Example Problems in Hindi 20:48
- DAA66: Minimum Spanning Tree Algorithm | Sapnning Tree | Properties of Spanning Tree 10:01
- DAA67:Minimum Spanning Tree Kruskal Algorithm | Kruskal's Algorithm Step by Step Explanation 21:30
- DAA68: Minimum Spanning Tree Prim's Algorithm Pseudocod|Prims Algorithm Step by Step Solved 22:02
- DAA69: Single Source Shortest Path Algorithm Using Greedy Method | Step by Step Solved Examples 13:15
- DAA70: Dijkstra Algorithm - Single Source Shortest Path - Greedy Method | Dijkstra algo Example 10:29
- DAA71:Bellman Ford Algorithm Step by Step|Bellman Ford Algorithm using Dynamic Programming technique 14:30
- DAA78: All Pair Shortest Path Floyd Warshall Algorithm Dynamic Programming 25:37
- DAA16: Sorting Algorithms | Bubble Sort, Concept, Algorithm, Examples, Time And Space Complexity 22:15
- DAA17: Sorting Algorithms | Selection Sort,Concept, Algorithm, Examples, Time And Space Complexity 15:25
- DAA18: Sorting Algorithms | Insertion sort ,Concept, Algorithm, Examples, Time And Space Complexity 19:26
- DAA19: Sorting Algorithms | Shell sort ,Concept, Algorithm, Examples, Time And Space Complexity 23:21
- DAA20: Sorting Algorithms | Quick Sort algo, Concept, Algorithm, Examples, Time And Space Complexity 29:23
- DAA21: Sorting Algorithms | Merge Sort Algorithm, Concept, Examples, Time And Space Complexity 25:28
- DAA22: Sorting Algorithms | Heap Sort Algorithm | Complete Binary Tree| Max Heap | Min Heap in hindi 28:57
- DAA23:Sorting Algorithms| Heap Sort Algorithm| Build Max Heap| Max Heapify Algorithm solved example 29:33
- DAA24: Sorting in Linear Time| Counting Sort Algorithm, Examples TIme And Space complexity 22:34
- DAA1: Design and Analysis of Algorithm| DAA Tutorial | Algorithm Syllabus| Course Overview 05:38
- DAA3: Difference Between Algorithm, Pseudocode and Program| Design And Analysis of Algorithms 10:40
- DAA 9: Introduction to Recurrence Relation in DAA| Recurrence relation rules and examples 11:31
- DAA10: Solving Recurrence Relations in daa |recurrences substitution method examples in Hindi Part-1 10:04
- DAA11: Solving Recurrence Relations in daa |recurrences substitution method examples in Hindi Part-2 07:58
- DAA12: Recursion Tree Method for Solving Recurrences| Rules and Examples in Hindi 07:22
- DAA14: Master Method for Solving Recurrence Relation in hindi | Master Theorem| Cases in Master 15:21
- DAA15: Master Method for Solving Recurrence Relation in hindi | Master theorem Solved Examples 09:08
- DAA25: Sorting in Linear Time| Counting Sort Algorithm, Solved Examples Time And Space complexity 09:12
- DAA26: Sorting in Linear Time| Radix Sort Algorithm, Solved Examples, Time And Space complexity 11:35
- DAA27: Sorting in Linear Time| Bucket Sort Algorithm, Solved Examples Time And Space complexity 08:50
- DAA28: Red Black Tree | Binary Search Tree Insertion and Deletion | RB-Tree insert delete 17:12
- DAA29| Red Black Tree Introduction | Red Black Tree Rules| RB Tree Properties 16:05
- DAA30| Red Black Tree| A Red-Black Tree with n internal nodes has height at most 2log(n + 1) 12:55
- DAA31: Red Black Tree Left Rotation Algorithm|Red Black Tree Right Rotation|RB roration with example 15:33
- DAA32:Red Black Tree Insertion |RB INSERT(T,z)|Create Red Black Tree|Complexity of RB Tree insertion 11:10
- DAA33: Red Black Tree Insertion Fixup |RB INSERT FIXUP (T z) |Complexity of RB Tree insertion 16:22
- DAA34: Red Black Tree Insertion and Fixup Example | RB Tree insertion fixup Solved Example 19:45
- DAA35: Red Black Tree Deletion| RB- Delete(T,z), RB- Delete Fixup(T,x)| RB Delete Explained in Hindi 24:17
- DAA36:Red Black Tree Deletion| RB- Delete(T,z), RB- Delete Fixup(T,x)| RB Delete Cases in Hindi 14:00
- DAA37:Red Black Tree Deletion Solved Example | RB Delete Important solved Questions 15:36
- DAA39:B-Tree|If n =1,then for any n-key B-tree T of height h minimum degree t=2,h=Log t (n+1)/2 11:10
- DAA45:Binomial Heap and Binomial Tree| Binomial Tree Properties| Binomial Tree Example 15:24
- DAA46:Binomial Heap and Binomial Tree| Binomial Heap Properties| Binomial Heap Representation 11:54
- DAA47:Binomial Heap Operations|Uniting Two Binomial Heaps|Create a new binomial heap|finding minimum 18:43
- DAA48:Binomial Heap Operations|Inserting a node|Extracting minimum key|Decreasing Key |delete a Node 14:49
- DAA49: Binomial Heap and Binomial Tree solved Univerity Question|Union and Insert in binomial heap 18:25
- DAA50: Fibonacci Heap in DAA| Fibonacci Heap Properties| Fibonacci Heap Memory Representation 13:07
- DAA51: Fibonacci Heap Operations| Creating a new Fibonacci Heap| Inserting node| Finding Minimum 10:59
- DAA52: Fibonacci Heap Operations| Extract min in fibonacci heap| FIB-HEAP-EXTRACT-MIN(H) in Hindi 14:18
- DAA53:Fibonacci Heap Operations| Decreasing a key and deleting a node|FIB-HEAP-DECREASE-KEY(H, x, k) 12:40
- DAA54:Trie Data Structure in daa |Digitat Tree| Prefix Tree |Trie applications|Search Insert Delete 14:51
- DAA55: Skip list data structure| Skip list operations| Skip list Search Insert Delete 13:21
- DAA56: Divide and Conquer Strategy in Algorithm| Search | Sort | MiX-Min|Strassens Matrix Multiply 09:25
- DAA57: Binary Search Algorithm and Complexity Analysis using Divide and Conquer Method 13:10
- DAA58: Finding Maximum and Minimum using Divide and Conquer in daa 15:01
- DAA59: Strassen's Matrix Multiplication using Divide and Conquer Method | Strassen's complexity 21:53
- DAA60: Convex Hull Problem using Divide and Conquer in Algorithm in hindi 12:11
- DAA61: Greedy Algorithm in Design and Analysis of Algorithms| Optimization Problem Representation 15:07
- DAA62: Activity Selection Problem using Greedy Algorithm| Greedy Activity Selection Problem example 16:28
- DAA64: Job Sequencing with Deadlines Greedy Method | step by step solved Examples 11:37
- DAA65: Knapsack Problem Algorithm using Greedy Method| Fractional Knapsack Problem Example 15:36
- DAA72:Introduction to Dynamic Programming| Memoization and Tabulation Method in Dynamic Programming 15:15
- DAA73: Dynamic Programming Vs Divide and Conquer | Greedy Approach Vs Dynamic Programming 11:23
- DAA74: Application of Dynamic Programming | Multistage Graph Problem using Dynamic Programming 24:36
- DAA75: 0/1 Knapsack Problem using Dynamic Programming | 0/1knapsack using tabulation and set method 20:18
- DAA76: 0/1 Knapsack using Tabulation and Set Method using Dynamic Programming Solved Example 10:35
- DAA77: 0/1 Knapsack Problem using Dynamic Programming Example 12:34
- DAA79: Resource Allocation Problem Multistage Graph Solution | Dynamic Programming 27:51
- DAA80: Matrix Chain Multiplication Algorithm Using Dynamic Programming with example. 18:01
- DAA81: Matrix Chain Multiplication Algorithm Using Dynamic Programming with example, PART-2 30:36
- DAA82: Longest Common Subsequence (LCS) Algorithm using Dynamic Programming 19:17
- DAA83: Travelling Salesperson Problem(TSP)using Dynamic Programming| Travelling Salesman Problem 26:43
- DAA84: Introduction to Backtracking | Backtracking Algorithm for Constraint Satisfaction Problem 12:28
- DAA85: N Queens Problem using Backtracking | 4 queen problem | 8 queens problem 14:46
- DAA86: Sum of Subset Problem Using Backtracking Algorithm | Sum of Subset Problem Examples 15:37
- DAA87: Graph Coloring Problem using Backtracking Algorithm | Graph Coloring Examples 17:56
- DAA88: Hamiltonian Circuit Problem using Backtracking Algorithm | Hamiltonian Cycle Problem 17:44
- DAA89: Branch and Bound algorithm | FIFO Branch Bound | LIFO Branch Bound | LC Branch Bound 21:50
- DAA90: 0/1 Knapsack Problem using Least Cost Branch and Bound Algorithm | 0/1 Kanapsack using LCBB 18:32
- DAA91: Travelling Salesman Problem using Branch and Bound | TSP using LCBB algorithm 26:01
- DAA92:String Matching Algorithm in DAA | Pattern Matching Algorithm in Hindi 09:13
- DAA93:String Matching Algorithm | Naive String Matching Algorithm Explanation 10:32
- DAA94: Rabin Karp String Matching Algorithm in Design and Analysis of Algorithm 12:20
- DAA95: Rabin Karp String Matching Algorithm Solved Example in Hindi 04:51
- DAA96: Algorithm for String Matching with Finite Automata | Finite Automata String Matching 27:13
- DAA97: Knuth Morris Pratt String Matching Algorithm | KMPalgorithm in Hindi 19:54
- DAA98:Design and Analysis of Algorithm DAA|NP Hard |NP Complete|NP Completeness Problem in Hindi 14:41
- DAA99:NP Hard and NP Complete|Polynomial Non polynomial| Deterministic Non deterministic Algorithm 20:57
- DAA100: Approximation Algorithms for Vertex Cover Problem | Node Cover Problem is NP Complete 15:52
- DAA101: Randomized Algorithms in DAA| Las Vegas Algorithm | Monte Carlo Algorithm 09:11
- DAA: Design and Analysis of Algorithms Unit-Wise Important Question For AKTU Semester Examination 10:01
