Bresenham's Circle Drawing Algorithm - Computer Graphics

[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

7 Branch and Bound Introduction

6.2 Sum Of Subsets Problem - Backtracking

6.1 N Queens Problem using Backtracking

6 Introduction to Backtracking - Brute Force Approach

5.2 Articulation Point and Biconnected Components

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

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

4.7 Traveling Salesperson Problem - Dynamic Programming

4.5 0/1 Knapsack - Two Methods - Dynamic Programming

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

4.3 Matrix Chain Multiplication - Dynamic Programming

4.1 MultiStage Graph - Dynamic Programming

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

4 Principle of Optimality - Dynamic Programming introduction

3.6 Dijkstra Algorithm - Single Source Shortest Path - Greedy Method

3.5 Prims and Kruskals Algorithms - Greedy Method

3.4 Huffman Coding - Greedy Method

3.2 Job Sequencing with Deadlines - Greedy Method

3.3 Optimal Merge Pattern - Greedy Method

3.1 Knapsack Problem - Greedy Method

3. Greedy Method - Introduction

2.9 Strassens Matrix Multiplication

2.8.2 QuickSort Analysis

2.8.1 QuickSort Algorithm

2.7.3 MergeSort in-depth Analysis

1.5.3 Time Complexity of While and if #3

2.7.2. Merge Sort Algorithm

2.7.1 Two Way MergeSort - Iterative method

2.6.1 Binary Search Iterative Method