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

	Name	Last modified	Size	Description
	Parent Directory		-
	1.2 Characteristics of Algorithm/	2025-05-31 09:43	-
	1.10.2 Comparison of Functions #2/	2025-05-31 09:43	-
	1.12 Disjoint Sets Data Structure - Weighted Union and Collapsing Find/	2025-05-31 09:43	-
	2.1.2 Recurrence Relation (T(n)= T(n-1) + n) #2/	2025-05-31 09:43	-
	2.1.3 Recurrence Relation (T(n)= T(n-1) + log n) #3/	2025-05-31 09:43	-
	2.3.1 Recurrence Relation Dividing Function T(n)=T(n2)+1 #1/	2025-05-31 09:43	-
	2.3.2 Recurrence Relation Dividing T(n)=T(n2)+ n. #2/	2025-05-31 09:43	-
	2.3.3 Recurrence Relation T(n)= 2T(n2) +n #3/	2025-05-31 09:43	-
	2.4.1 Masters Theorem in Algorithms for Dividing Function #1/	2025-05-31 09:43	-
	2.4.2 Examples for Master Theorem #2/	2025-05-31 09:43	-
	2.5 Root function (Recurrence Relation)/	2025-05-31 09:43	-
	2.6.1 Binary Search Iterative Method/	2025-05-31 09:43	-
	2.6.2 Binary Search Recursive Method/	2025-05-31 09:43	-
	2.6.3 Heap - Heap Sort - Heapify - Priority Queues/	2025-05-31 09:43	-
	2.7.1 Two Way MergeSort - Iterative method/	2025-05-31 09:43	-
	2.9 Strassens Matrix Multiplication/	2025-05-31 09:43	-
	2 Divide And Conquer/	2025-05-31 09:43	-
	3.2 Job Sequencing with Deadlines - Greedy Method/	2025-05-31 09:43	-
	3.4 Huffman Coding - Greedy Method/	2025-05-31 09:43	-
	3.5 Prims and Kruskals Algorithms - Greedy Method/	2025-05-31 09:43	-
	3.6 Dijkstra Algorithm - Single Source Shortest Path - Greedy Method/	2025-05-31 09:43	-
	4.1.1 MultiStage Graph (Program) - Dynamic Programming/	2025-05-31 09:43	-
	4.1 MultiStage Graph - Dynamic Programming/	2025-05-31 09:43	-
	4.2 All Pairs Shortest Path (Floyd-Warshall) - Dynamic Programming/	2025-05-31 09:43	-
	4.3.1 Matrix Chain Multiplication (Program) - Dynamic Programming/	2025-05-31 09:43	-
	4.3 Matrix Chain Multiplication - Dynamic Programming/	2025-05-31 09:43	-
	4.4 Bellman Ford Algorithm - Single Source Shortest Path - Dynamic Programming/	2025-05-31 10:13	-
	4.5.1 01 Knapsack Problem (Program) - Dynamic Programming/	2025-05-31 10:13	-
	4.5 01 Knapsack - Two Methods - Dynamic Programming/	2025-05-31 10:13	-
	4.6.2 New Optimal Binary Search Tree Successful and Unsuccessful Probability - Dynamic Programming/	2025-05-31 10:13	-
	4.6 Optimal Binary Search Tree (Successful Search Only) - Dynamic Programming/	2025-05-31 10:13	-
	4.8 Reliability Design - Dynamic Programming/	2025-05-31 10:13	-
	4.9 Longest Common Subsequence (LCS) - Recursion and Dynamic Programming/	2025-05-31 10:13	-
	4 Principle of Optimality - Dynamic Programming introduction/	2025-05-31 09:43	-
	5.1 Graph Traversals - BFS & DFS -Breadth First Search and Depth First Search/	2025-05-31 10:13	-
	5.2 Articulation Point and Biconnected Components/	2025-05-31 10:13	-
	6.1 N Queens Problem using Backtracking/	2025-05-31 10:13	-
	6.2 Sum Of Subsets Problem - Backtracking/	2025-05-31 10:13	-
	6.3 Graph Coloring Problem - Backtracking/	2025-05-31 10:13	-
	6.4 Hamiltonian Cycle - Backtracking/	2025-05-31 10:13	-
	6 Introduction to Backtracking - Brute Force Approach/	2025-05-31 10:13	-
	7.1 Job Sequencing with Deadline - Branch and Bound/	2025-05-31 10:13	-
	7.2 01 Knapsack using Branch and Bound/	2025-05-31 10:13	-
	7.3 Traveling Salesman Problem - Branch and Bound/	2025-05-31 10:13	-
	8.1 NP-Hard Graph Problem - Clique Decision Problem/	2025-05-31 10:13	-
	9.1 Knuth-Morris-Pratt KMP String Matching Algorithm/	2025-05-31 10:13	-
	9.2 Rabin-Karp String Matching Algorithm/	2025-05-31 10:13	-
	10.2 B Trees and B+ Trees. How they are useful in Databases/	2025-05-31 10:13	-
	Hashing Technique - Simplified/	2025-05-31 10:13	-
	New Matrix Chain Multiplication using Dynamic Programming Formula/	2025-05-31 09:43	-
	Row-Major and Column-Major Mapping/	2025-05-31 10:13	-