Abdul Bari

Computer Science

I have started this channel to help Students Community to learn difficult topics, from computer science, with a simple and detailed explanation.
I have been teaching some computer science subjects and Programming Languages for a long time and also been working as a freelancer and providing software solutions.
My experience and understanding of subjects may help students.

Bresenham's Circle Drawing Algorithm - Computer Graphics

Bresenham's Circle Drawing Algorithm - Computer Graphics
[New] Matrix Chain Multiplication using Dynamic Programming Formula

[New] Matrix Chain Multiplication using Dynamic Programming Formula
4.6.2 [New] Optimal Binary Search Tree Successful and Unsuccessful Probability - Dynamic Programming

4.6.2 [New] Optimal Binary Search Tree Successful and Unsuccessful Probability - Dynamic Programming
Bresenham's Line Drawing Algorithm

Bresenham's Line Drawing Algorithm
2.6.3 Heap - Heap Sort - Heapify - Priority Queues

2.6.3 Heap - Heap Sort - Heapify - Priority Queues
4.9 Longest Common Subsequence (LCS) - Recursion and Dynamic Programming

4.9 Longest Common Subsequence (LCS) - Recursion and Dynamic Programming
7.3 Traveling Salesman Problem - Branch and Bound

7.3 Traveling Salesman Problem - Branch and Bound
DDA Line Drawing Algorithm - Computer Graphics

DDA Line Drawing Algorithm - Computer Graphics
4.8 Reliability Design - Dynamic Programming

4.8 Reliability Design - Dynamic Programming
8.1 NP-Hard Graph Problem - Clique Decision Problem

8.1 NP-Hard Graph Problem - Clique Decision Problem
6.4 Hamiltonian Cycle - Backtracking

6.4 Hamiltonian Cycle - Backtracking
1.12 Disjoint Sets Data Structure - Weighted Union and Collapsing Find

1.12 Disjoint Sets Data Structure - Weighted Union and Collapsing Find
4.7 [New] Traveling Salesman Problem - Dynamic Programming using Formula

4.7 [New] Traveling Salesman Problem - Dynamic Programming using Formula
6. Everything about Variables in JAVA

6. Everything about Variables in JAVA
9.2 Rabin-Karp String Matching Algorithm

9.2 Rabin-Karp String Matching Algorithm
10.2 B Trees and B+ Trees. How they are useful in Databases

10.2 B Trees and B+ Trees. How they are useful in Databases
5. Everything about JAVA Data Types

5. Everything about JAVA Data Types
4. Why public static void main(String args[ ]) ? JAVA

4. Why public static void main(String args[ ]) ? JAVA
3. Why to Set Path ? JAVA

3. Why to Set Path ? JAVA
9.1 Knuth-Morris-Pratt KMP String Matching Algorithm

9.1 Knuth-Morris-Pratt KMP String Matching Algorithm
2. Why and How Java is platform independent

2. Why and How Java is platform independent
1. Why One should Learn Java - Introduction to Java

1. Why One should Learn Java - Introduction to Java
10.1 AVL Tree - Insertion and Rotations

10.1 AVL Tree - Insertion and Rotations
4.3.1 Matrix Chain Multiplication (Program) - Dynamic Programming

4.3.1 Matrix Chain Multiplication (Program) - Dynamic Programming
4.5.1 0/1 Knapsack Problem (Program) - Dynamic Programming

4.5.1 0/1 Knapsack Problem (Program) - Dynamic Programming
1.1 Priori Analysis and Posteriori Testing

1.1 Priori Analysis and Posteriori Testing
4.1.1 MultiStage Graph (Program) - Dynamic Programming

4.1.1 MultiStage Graph (Program) - Dynamic Programming
8. NP-Hard and NP-Complete Problems

8. NP-Hard and NP-Complete Problems
7.2 0/1 Knapsack using Branch and Bound

7.2 0/1 Knapsack using Branch and Bound
7.1 Job Sequencing with Deadline - Branch and Bound

7.1 Job Sequencing with Deadline - Branch and Bound