Index of /knowledgeBase/VideoSummaries/Abdul Bari

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