Все публикации

[New] Matrix Chain0:52:02

[New] Matrix Chain Multiplication using Dynamic Programming Formula

4.6.2 [New] Optimal0:57:00

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

Bresenham's Line Drawing0:43:39

Bresenham's Line Drawing Algorithm

2.6.3 Heap -0:51:08

2.6.3 Heap - Heap Sort - Heapify - Priority Queues

4.9 Longest Common0:23:35

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

7.3 Traveling Salesman0:24:42

7.3 Traveling Salesman Problem - Branch and Bound

DDA Line Drawing0:26:48

DDA Line Drawing Algorithm - Computer Graphics

4.8 Reliability Design0:26:32

4.8 Reliability Design - Dynamic Programming

8.1 NP-Hard Graph0:17:14

8.1 NP-Hard Graph Problem - Clique Decision Problem

6.4 Hamiltonian Cycle0:18:35

6.4 Hamiltonian Cycle - Backtracking

1.12 Disjoint Sets0:26:04

1.12 Disjoint Sets Data Structure - Weighted Union and Collapsing Find

4.7 [New] Traveling0:17:18

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

6. Everything about0:29:05

6. Everything about Variables in JAVA

9.2 Rabin-Karp String0:23:50

9.2 Rabin-Karp String Matching Algorithm

10.2 B Trees0:39:41

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

3. Why to0:14:02

3. Why to Set Path ? JAVA

4. Why public0:13:18

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

5. Everything about0:27:54

5. Everything about JAVA Data Types

9.1 Knuth-Morris-Pratt KMP0:18:56

9.1 Knuth-Morris-Pratt KMP String Matching Algorithm

2. Why and0:19:04

2. Why and How Java is platform independent

1. Why One0:14:27

1. Why One should Learn Java - Introduction to Java

10.1 AVL Tree0:43:08

10.1 AVL Tree - Insertion and Rotations

4.3.1 Matrix Chain0:18:40

4.3.1 Matrix Chain Multiplication (Program) - Dynamic Programming

1.1 Priori Analysis0:01:48

1.1 Priori Analysis and Posteriori Testing