Index of /knowledgeBase/VideoSummaries/2025-05-30/Abdul Bari

[ICO]NameLast modifiedSizeDescription
[PARENTDIR]Parent Directory  -  
[DIR]1.1 Priori Analysis and Posteriori Testing/2025-05-30 22:42 -  
[DIR]1.2 Characteristics of Algorithm/2025-05-30 22:42 -  
[DIR]1.3 How Write and Analyze Algorithm/2025-05-30 22:42 -  
[DIR]1.4 Frequency Count Method/2025-05-30 22:42 -  
[DIR]1.5.1 Time Complexity #1/2025-05-30 22:42 -  
[DIR]1.5.2 Time Complexity Example #2/2025-05-30 22:42 -  
[DIR]1.5.3 Time Complexity of While and if #3/2025-05-30 22:42 -  
[DIR]1.6 Classes of functions/2025-05-30 22:42 -  
[DIR]1.7 Compare Class of Functions/2025-05-30 22:42 -  
[DIR]1.8.1 Asymptotic Notations Big Oh - Omega - Theta #1/2025-05-30 23:12 -  
[DIR]1.8.2 Asymptotic Notations - Big Oh - Omega - Theta #2/2025-05-30 23:12 -  
[DIR]1.9 Properties of Asymptotic Notations/2025-05-30 23:12 -  
[DIR]1.10.1 Comparison of Functions #1/2025-05-30 23:12 -  
[DIR]1.10.2 Comparison of Functions #2/2025-05-30 23:12 -  
[DIR]1.11 Best Worst and Average Case Analysis/2025-05-30 23:12 -  
[DIR]1.12 Disjoint Sets Data Structure - Weighted Union and Collapsing Find/2025-05-30 23:12 -  
[DIR]1. Introduction to Algorithms/2025-05-30 22:42 -  
[DIR]2.1.1 Recurrence Relation (T(n)= T(n-1) + 1) #1/2025-05-30 23:12 -  
[DIR]2.1.2 Recurrence Relation (T(n)= T(n-1) + n) #2/2025-05-30 23:12 -  
[DIR]2.1.3 Recurrence Relation (T(n)= T(n-1) + log n) #3/2025-05-30 23:12 -  
[DIR]2.1.4 Recurrence Relation T(n)=2 T(n-1)+1 #4/2025-05-30 23:12 -  
[DIR]2.2 Masters Theorem Decreasing Function/2025-05-30 23:12 -  
[DIR]2.3.1 Recurrence Relation Dividing Function T(n)=T(n2)+1 #1/2025-05-30 23:12 -  
[DIR]2.3.2 Recurrence Relation Dividing T(n)=T(n2)+ n. #2/2025-05-30 23:12 -  
[DIR]2.3.3 Recurrence Relation T(n)= 2T(n2) +n #3/2025-05-30 23:42 -  
[DIR]2.4.1 Masters Theorem in Algorithms for Dividing Function #1/2025-05-30 23:42 -  
[DIR]2.4.2 Examples for Master Theorem #2/2025-05-30 23:42 -  
[DIR]2.5 Root function (Recurrence Relation)/2025-05-30 23:42 -  
[DIR]2.6.1 Binary Search Iterative Method/2025-05-30 23:42 -  
[DIR]2.6.2 Binary Search Recursive Method/2025-05-30 23:42 -  
[DIR]2.6.3 Heap - Heap Sort - Heapify - Priority Queues/2025-05-30 23:42 -  
[DIR]2.7.1 Two Way MergeSort - Iterative method/2025-05-30 23:42 -  
[DIR]2.7.2. Merge Sort Algorithm/2025-05-30 23:42 -  
[DIR]2.7.3 MergeSort in-depth Analysis/2025-05-30 23:42 -  
[DIR]2.8.1 QuickSort Algorithm/2025-05-30 23:42 -  
[DIR]2.8.2 QuickSort Analysis/2025-05-30 23:42 -  
[DIR]2.9 Strassens Matrix Multiplication/2025-05-30 23:42 -  
[DIR]3.1 Knapsack Problem - Greedy Method/2025-05-31 00:12 -  
[DIR]3.2 Job Sequencing with Deadlines - Greedy Method/2025-05-31 00:12 -  
[DIR]3.3 Optimal Merge Pattern - Greedy Method/2025-05-31 00:12 -  
[DIR]3.4 Huffman Coding - Greedy Method/2025-05-31 00:12 -  
[DIR]3.5 Prims and Kruskals Algorithms - Greedy Method/2025-05-31 00:12 -  
[DIR]3.6 Dijkstra Algorithm - Single Source Shortest Path - Greedy Method/2025-05-31 00:12 -  
[DIR]3. Greedy Method - Introduction/2025-05-31 00:12 -  
[DIR]4.1.1 MultiStage Graph (Program) - Dynamic Programming/2025-05-31 00:12 -  
[DIR]4.1 MultiStage Graph - Dynamic Programming/2025-05-31 00:12 -  
[DIR]4.2 All Pairs Shortest Path (Floyd-Warshall) - Dynamic Programming/2025-05-31 00:12 -  
[DIR]4.3.1 Matrix Chain Multiplication (Program) - Dynamic Programming/2025-05-31 00:12 -  
[DIR]4.3 Matrix Chain Multiplication - Dynamic Programming/2025-05-31 00:12 -  
[DIR]4.4 Bellman Ford Algorithm - Single Source Shortest Path - Dynamic Programming/2025-05-31 00:12 -  
[DIR]4.5.1 01 Knapsack Problem (Program) - Dynamic Programming/2025-05-31 00:12 -  
[DIR]4.5 01 Knapsack - Two Methods - Dynamic Programming/2025-05-31 00:12 -  
[DIR]4.6.2 New Optimal Binary Search Tree Successful and Unsuccessful Probability - Dynamic Programming/2025-05-31 00:42 -  
[DIR]4.6 Optimal Binary Search Tree (Successful Search Only) - Dynamic Programming/2025-05-31 00:42 -  
[DIR]4.7 New Traveling Salesman Problem - Dynamic Programming using Formula/2025-05-31 00:42 -  
[DIR]4.8 Reliability Design - Dynamic Programming/2025-05-31 00:42 -  
[DIR]4.9 Longest Common Subsequence (LCS) - Recursion and Dynamic Programming/2025-05-31 00:42 -  
[DIR]4 Principle of Optimality - Dynamic Programming introduction/2025-05-31 00:12 -  
[DIR]5.2 Articulation Point and Biconnected Components/2025-05-31 00:42 -  
[DIR]6.1 N Queens Problem using Backtracking/2025-05-31 00:42 -  
[DIR]6.3 Graph Coloring Problem - Backtracking/2025-05-31 00:42 -  
[DIR]6.4 Hamiltonian Cycle - Backtracking/2025-05-31 00:42 -  
[DIR]6 Introduction to Backtracking - Brute Force Approach/2025-05-31 00:42 -  
[DIR]7.2 01 Knapsack using Branch and Bound/2025-05-31 00:42 -  
[DIR]7.3 Traveling Salesman Problem - Branch and Bound/2025-05-31 00:42 -  
[DIR]7 Branch and Bound Introduction/2025-05-31 00:42 -  
[DIR]8.1 NP-Hard Graph Problem - Clique Decision Problem/2025-05-31 00:42 -  
[DIR]8. NP-Hard and NP-Complete Problems/2025-05-31 00:42 -  
[DIR]9.1 Knuth-Morris-Pratt KMP String Matching Algorithm/2025-05-31 00:42 -  
[DIR]9.2 Rabin-Karp String Matching Algorithm/2025-05-31 01:12 -  
[DIR]10.1 AVL Tree - Insertion and Rotations/2025-05-31 01:12 -  
[DIR]10.2 B Trees and B+ Trees. How they are useful in Databases/2025-05-31 01:12 -  
[DIR]Asymptotic Notations - Simplified/2025-05-31 01:12 -  
[DIR]BFS DFS - Simplified/2025-05-31 01:12 -  
[DIR]Merge Sort Algorithm - Hindi/2025-05-31 01:12 -  
[DIR]New Matrix Chain Multiplication using Dynamic Programming Formula/2025-05-31 00:12 -  
[DIR]Row-Major and Column-Major Mapping/2025-05-31 01:12 -  
[DIR]Shortest Path Algorithms (Dijkstra and Bellman-Ford) - Simplified/2025-05-31 01:12 -  
[DIR]Tower of Hanoi Problem - Made Easy/2025-05-31 01:12 -  
Apache/2.4.52 (Ubuntu) Server at 146.19.207.51 Port 80