52:02

[New] Matrix Chain Multiplication using Dynamic Programming Formula

57:00

4.6.2 [New] Optimal Binary Search Tree Successful and Unsuccessful Probability - Dynamic Programming

43:39

Bresenham's Line Drawing Algorithm

51:08

2.6.3 Heap - Heap Sort - Heapify - Priority Queues

23:35

4.9 Longest Common Subsequence (LCS) - Recursion and Dynamic Programming

24:42

7.3 Traveling Salesman Problem - Branch and Bound

26:48

DDA Line Drawing Algorithm - Computer Graphics

26:32

4.8 Reliability Design - Dynamic Programming

17:14

8.1 NP-Hard Graph Problem - Clique Decision Problem

18:35

6.4 Hamiltonian Cycle - Backtracking

26:04

1.12 Disjoint Sets Data Structure - Weighted Union and Collapsing Find

17:18

4.7 [New] Traveling Salesman Problem - Dynamic Programming using Formula

29:05

6. Everything about Variables in JAVA

23:50

9.2 Rabin-Karp String Matching Algorithm

39:41

10.2 B Trees and B+ Trees. How they are useful in Databases

27:54

5. Everything about JAVA Data Types

13:18

4. Why public static void main(String args[ ]) ? JAVA

14:02

3. Why to Set Path ? JAVA

18:56

9.1 Knuth-Morris-Pratt KMP String Matching Algorithm

19:04

2. Why and How Java is platform independent

14:27

1. Why One should Learn Java - Introduction to Java

43:08

10.1 AVL Tree - Insertion and Rotations

18:40

4.3.1 Matrix Chain Multiplication (Program) - Dynamic Programming

17:00

4.5.1 0/1 Knapsack Problem (Program) - Dynamic Programming

01:48

1.1 Priori Analysis and Posteriori Testing

14:26

4.1.1 MultiStage Graph (Program) - Dynamic Programming

31:53

8. NP-Hard and NP-Complete Problems

10:48

7.2 0/1 Knapsack using Branch and Bound

10:56

7.1 Job Sequencing with Deadline - Branch and Bound

15:52

6.3 Graph Coloring Problem - Backtracking

09:40

7 Branch and Bound Introduction

12:19

6.2 Sum Of Subsets Problem - Backtracking

13:41

6.1 N Queens Problem using Backtracking

08:15

6 Introduction to Backtracking - Brute Force Approach

08:37

5.2 Articulation Point and Biconnected Components

18:31

5.1 Graph Traversals - BFS & DFS -Breadth First Search and Depth First Search

30:19

4.6 Optimal Binary Search Tree (Successful Search Only) - Dynamic Programming

15:25

4.7 Traveling Salesperson Problem - Dynamic Programming

28:24

4.5 0/1 Knapsack - Two Methods - Dynamic Programming

17:12

4.4 Bellman Ford Algorithm - Single Source Shortest Path - Dynamic Programming

23:00

4.3 Matrix Chain Multiplication - Dynamic Programming

21:07

4.1 MultiStage Graph - Dynamic Programming

14:13

4.2 All Pairs Shortest Path (Floyd-Warshall) - Dynamic Programming

14:52

4 Principle of Optimality - Dynamic Programming introduction

18:35

3.6 Dijkstra Algorithm - Single Source Shortest Path - Greedy Method

20:12

3.5 Prims and Kruskals Algorithms - Greedy Method

17:44

3.4 Huffman Coding - Greedy Method

13:29

3.2 Job Sequencing with Deadlines - Greedy Method

09:33

3.3 Optimal Merge Pattern - Greedy Method

15:30

3.1 Knapsack Problem - Greedy Method

12:02

3. Greedy Method - Introduction

23:40

2.9 Strassens Matrix Multiplication

11:37

2.8.2 QuickSort Analysis

13:43

2.8.1 QuickSort Algorithm

13:28

2.7.3 MergeSort in-depth Analysis

21:54

1.5.3 Time Complexity of While and if #3

24:07

2.7.2. Merge Sort Algorithm

20:19

2.7.1 Two Way MergeSort - Iterative method

19:36

2.6.1 Binary Search Iterative Method

07:11

2.6.2 Binary Search Recursive Method