[New] Matrix Chain Multiplication using Dynamic Programming Formula

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

Bresenham's Line Drawing Algorithm

2.6.3 Heap - Heap Sort - Heapify - Priority Queues

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

7.3 Traveling Salesman Problem - Branch and Bound

DDA Line Drawing Algorithm - Computer Graphics

4.8 Reliability Design - Dynamic Programming

8.1 NP-Hard Graph Problem - Clique Decision Problem

6.4 Hamiltonian Cycle - Backtracking

1.12 Disjoint Sets Data Structure - Weighted Union and Collapsing Find

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

6. Everything about Variables in JAVA

9.2 Rabin-Karp String Matching Algorithm

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

5. Everything about JAVA Data Types

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

3. Why to Set Path ? JAVA

9.1 Knuth-Morris-Pratt KMP String Matching Algorithm

2. Why and How Java is platform independent

1. Why One should Learn Java - Introduction to Java

10.1 AVL Tree - Insertion and Rotations

4.3.1 Matrix Chain Multiplication (Program) - Dynamic Programming

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

1.1 Priori Analysis and Posteriori Testing

4.1.1 MultiStage Graph (Program) - Dynamic Programming

8. NP-Hard and NP-Complete Problems

7.2 0/1 Knapsack using Branch and Bound

7.1 Job Sequencing with Deadline - Branch and Bound

6.3 Graph Coloring Problem - Backtracking