Abdul Bari

@UCZCFT11CWBi3MHNlGf019nw - 1.3M subscribers

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.

Home Videos Live Playlists

Bresenham's Circle Drawing Algorithm - Computer Graphics

Bresenham's Circle Drawing Algorithm - Computer Graphics Abdul Bari

75.1K views - 10 months ago

[New] Matrix Chain Multiplication using Dynamic Programming Formula

[New] Matrix Chain Multiplication using Dynamic Programming Formula Abdul Bari

1M views - 6 years ago

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 Abdul Bari

636.9K views - 6 years ago

Bresenham's Line Drawing Algorithm

Bresenham's Line Drawing Algorithm Abdul Bari

504.2K views - 6 years ago

2.6.3 Heap - Heap Sort - Heapify - Priority Queues

2.6.3 Heap - Heap Sort - Heapify - Priority Queues Abdul Bari

2.7M views - 6 years ago

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

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

1.5M views - 7 years ago

7.3 Traveling Salesman Problem - Branch and Bound

7.3 Traveling Salesman Problem - Branch and Bound Abdul Bari

2.4M views - 7 years ago

DDA Line Drawing Algorithm - Computer Graphics

DDA Line Drawing Algorithm - Computer Graphics Abdul Bari

611.6K views - 7 years ago

4.8 Reliability Design - Dynamic Programming

4.8 Reliability Design - Dynamic Programming Abdul Bari

486K views - 7 years ago

8.1 NP-Hard Graph Problem - Clique Decision Problem

8.1 NP-Hard Graph Problem - Clique Decision Problem Abdul Bari

802.8K views - 7 years ago

6.4 Hamiltonian Cycle - Backtracking

6.4 Hamiltonian Cycle - Backtracking Abdul Bari

1.3M views - 7 years ago

1.12 Disjoint Sets Data Structure - Weighted Union and Collapsing Find

1.12 Disjoint Sets Data Structure - Weighted Union and Collapsing Find Abdul Bari

1.1M views - 7 years ago

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

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

663.1K views - 7 years ago

6. Everything about Variables in JAVA

6. Everything about Variables in JAVA Abdul Bari

51.8K views - 7 years ago

9.2 Rabin-Karp String Matching Algorithm

9.2 Rabin-Karp String Matching Algorithm Abdul Bari

1.1M views - 7 years ago

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 Abdul Bari

1.5M views - 7 years ago

5. Everything about JAVA Data Types

5. Everything about JAVA Data Types Abdul Bari

56.2K views - 7 years ago

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

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

104.1K views - 7 years ago

3. Why to Set Path ? JAVA

3. Why to Set Path ? JAVA Abdul Bari

52.6K views - 7 years ago

9.1 Knuth-Morris-Pratt KMP String Matching Algorithm

9.1 Knuth-Morris-Pratt KMP String Matching Algorithm Abdul Bari

2.3M views - 7 years ago

2. Why and How Java is platform independent

2. Why and How Java is platform independent Abdul Bari

83K views - 7 years ago

1. Why One should Learn Java - Introduction to Java

1. Why One should Learn Java - Introduction to Java Abdul Bari

242.9K views - 7 years ago

10.1 AVL Tree - Insertion and Rotations

10.1 AVL Tree - Insertion and Rotations Abdul Bari

1.6M views - 7 years ago

4.3.1 Matrix Chain Multiplication (Program) - Dynamic Programming

4.3.1 Matrix Chain Multiplication (Program) - Dynamic Programming Abdul Bari

404.9K views - 7 years ago

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

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

727.3K views - 7 years ago

1.1 Priori Analysis and Posteriori Testing

1.1 Priori Analysis and Posteriori Testing Abdul Bari

1.4M views - 7 years ago

4.1.1 MultiStage Graph (Program) - Dynamic Programming

4.1.1 MultiStage Graph (Program) - Dynamic Programming Abdul Bari

405K views - 7 years ago

8. NP-Hard and NP-Complete Problems

8. NP-Hard and NP-Complete Problems Abdul Bari

2.5M views - 7 years ago

7.2 0/1 Knapsack using Branch and Bound

7.2 0/1 Knapsack using Branch and Bound Abdul Bari

1.6M views - 7 years ago

7.1 Job Sequencing with Deadline - Branch and Bound

7.1 Job Sequencing with Deadline - Branch and Bound Abdul Bari

461K views - 7 years ago

6.3 Graph Coloring Problem - Backtracking

6.3 Graph Coloring Problem - Backtracking Abdul Bari

1.5M views - 7 years ago

7 Branch and Bound Introduction

7 Branch and Bound Introduction Abdul Bari

1.2M views - 7 years ago

6.2 Sum Of Subsets Problem - Backtracking

6.2 Sum Of Subsets Problem - Backtracking Abdul Bari

1.8M views - 7 years ago

6.1 N Queens Problem using Backtracking

6.1 N Queens Problem using Backtracking Abdul Bari

2.7M views - 7 years ago

6 Introduction to Backtracking - Brute Force Approach

6 Introduction to Backtracking - Brute Force Approach Abdul Bari

1.7M views - 7 years ago

5.2 Articulation Point and Biconnected Components

5.2 Articulation Point and Biconnected Components Abdul Bari

639K views - 7 years ago

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

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

4.7M views - 7 years ago

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

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

1.4M views - 7 years ago

4.7 Traveling Salesperson Problem - Dynamic Programming

4.7 Traveling Salesperson Problem - Dynamic Programming Abdul Bari

2M views - 7 years ago

4.5 0/1 Knapsack - Two Methods - Dynamic Programming

4.5 0/1 Knapsack - Two Methods - Dynamic Programming Abdul Bari

3.8M views - 7 years ago

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

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

2.2M views - 8 years ago

4.3 Matrix Chain Multiplication - Dynamic Programming

4.3 Matrix Chain Multiplication - Dynamic Programming Abdul Bari

2.3M views - 8 years ago

4.1 MultiStage Graph - Dynamic Programming

4.1 MultiStage Graph - Dynamic Programming Abdul Bari

1.3M views - 8 years ago

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

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

3.3M views - 8 years ago

4 Principle of Optimality - Dynamic Programming introduction

4 Principle of Optimality - Dynamic Programming introduction Abdul Bari

1.5M views - 8 years ago

3.6 Dijkstra Algorithm - Single Source Shortest Path - Greedy Method

3.6 Dijkstra Algorithm - Single Source Shortest Path - Greedy Method Abdul Bari

4.6M views - 8 years ago

3.5 Prims and Kruskals Algorithms - Greedy Method

3.5 Prims and Kruskals Algorithms - Greedy Method Abdul Bari

3.6M views - 8 years ago

3.4 Huffman Coding - Greedy Method

3.4 Huffman Coding - Greedy Method Abdul Bari

2.2M views - 8 years ago

3.2 Job Sequencing with Deadlines - Greedy Method

3.2 Job Sequencing with Deadlines - Greedy Method Abdul Bari

1.8M views - 8 years ago

3.3 Optimal Merge Pattern - Greedy Method

3.3 Optimal Merge Pattern - Greedy Method Abdul Bari

686.3K views - 8 years ago

3.1 Knapsack Problem - Greedy Method

3.1 Knapsack Problem - Greedy Method Abdul Bari

2.9M views - 8 years ago

3. Greedy Method - Introduction

3. Greedy Method - Introduction Abdul Bari

1.8M views - 8 years ago

2.9 Strassens Matrix Multiplication

2.9 Strassens Matrix Multiplication Abdul Bari

1.5M views - 8 years ago

2.8.2 QuickSort Analysis

2.8.2 QuickSort Analysis Abdul Bari

1M views - 8 years ago

2.8.1 QuickSort Algorithm

2.8.1 QuickSort Algorithm Abdul Bari

3.8M views - 8 years ago

2.7.3 MergeSort in-depth Analysis

2.7.3 MergeSort in-depth Analysis Abdul Bari

419.8K views - 8 years ago

1.5.3 Time Complexity of While and if #3

1.5.3 Time Complexity of While and if #3 Abdul Bari

1.2M views - 8 years ago

2.7.2. Merge Sort Algorithm

2.7.2. Merge Sort Algorithm Abdul Bari

2.2M views - 8 years ago

2.7.1 Two Way MergeSort - Iterative method

2.7.1 Two Way MergeSort - Iterative method Abdul Bari

883.7K views - 8 years ago

2.6.1 Binary Search Iterative Method

2.6.1 Binary Search Iterative Method Abdul Bari

1M views - 8 years ago