1
Bresenham's Circle Drawing Algorithm - Computer Graphics
1:01:38
2025-04-08
2
[New] Matrix Chain Multiplication using Dynamic Programming Formula
52:02
2019-05-12
3
4.6.2 [New] Optimal Binary Search Tree Successful and Unsuccessful Probability - Dynamic Programming
57:00
2019-04-02
4
Bresenham's Line Drawing Algorithm
43:39
2019-03-15
5
2.6.3 Heap - Heap Sort - Heapify - Priority Queues
51:08
2019-03-08
6
4.9 Longest Common Subsequence (LCS) - Recursion and Dynamic Programming
23:35
2018-04-19
7
7.3 Traveling Salesman Problem - Branch and Bound
24:42
2018-04-13
8
DDA Line Drawing Algorithm - Computer Graphics
26:48
2018-04-12
9
4.8 Reliability Design - Dynamic Programming
26:32
2018-04-11
10
8.1 NP-Hard Graph Problem - Clique Decision Problem
17:14
2018-04-09
11
6.4 Hamiltonian Cycle - Backtracking
18:35
2018-04-07
12
1.12 Disjoint Sets Data Structure - Weighted Union and Collapsing Find
26:04
2018-04-04
13
4.7 [New] Traveling Salesman Problem - Dynamic Programming using Formula
17:18
2018-04-02
14
6. Everything about Variables in JAVA
29:05
2018-04-01
15
9.2 Rabin-Karp String Matching Algorithm
23:50
2018-03-30
16
10.2 B Trees and B+ Trees. How they are useful in Databases
39:41
2018-03-30
17
5. Everything about JAVA Data Types
27:54
2018-03-26
18
4. Why public static void main(String args[ ]) ? JAVA
13:18
2018-03-26
19
3. Why to Set Path ? JAVA
14:02
2018-03-26
20
9.1 Knuth-Morris-Pratt KMP String Matching Algorithm
18:56
2018-03-25
21
2. Why and How Java is platform independent
19:04
2018-03-20
22
1. Why One should Learn Java - Introduction to Java
14:27
2018-03-18
23
10.1 AVL Tree - Insertion and Rotations
43:08
2018-03-16
24
4.3.1 Matrix Chain Multiplication (Program) - Dynamic Programming
18:40
2018-03-05
25
4.5.1 0/1 Knapsack Problem (Program) - Dynamic Programming
17:00
2018-03-04
26
1.1 Priori Analysis and Posteriori Testing
1:48
2018-03-04
27
4.1.1 MultiStage Graph (Program) - Dynamic Programming
14:26
2018-03-04
28
8. NP-Hard and NP-Complete Problems
31:53
2018-02-28
29
7.2 0/1 Knapsack using Branch and Bound
10:48
2018-02-26
30
7.1 Job Sequencing with Deadline - Branch and Bound
10:56
2018-02-26
31
6.3 Graph Coloring Problem - Backtracking
15:52
2018-02-26
32
7 Branch and Bound Introduction
9:40
2018-02-26
33
6.2 Sum Of Subsets Problem - Backtracking
12:19
2018-02-24
34
6.1 N Queens Problem using Backtracking
13:41
2018-02-24
35
6 Introduction to Backtracking - Brute Force Approach
8:15
2018-02-24
36
5.2 Articulation Point and Biconnected Components
8:37
2018-02-24
37
5.1 Graph Traversals - BFS & DFS -Breadth First Search and Depth First Search
18:31
2018-02-24
38
Abdul Bari Live Stream
—
39
4.6 Optimal Binary Search Tree (Successful Search Only) - Dynamic Programming
30:19
2018-02-22
40
4.7 Traveling Salesperson Problem - Dynamic Programming
15:25
2018-02-22
41
4.5 0/1 Knapsack - Two Methods - Dynamic Programming
28:24
2018-02-20
42
4.4 Bellman Ford Algorithm - Single Source Shortest Path - Dynamic Programming
17:12
2018-02-16
43
4.3 Matrix Chain Multiplication - Dynamic Programming
23:00
2018-02-16
44
4.1 MultiStage Graph - Dynamic Programming
21:07
2018-02-16
45
4.2 All Pairs Shortest Path (Floyd-Warshall) - Dynamic Programming
14:13
2018-02-16
46
4 Principle of Optimality - Dynamic Programming introduction
14:52
2018-02-16
47
3.6 Dijkstra Algorithm - Single Source Shortest Path - Greedy Method
18:35
2018-02-09
48
3.5 Prims and Kruskals Algorithms - Greedy Method
20:12
2018-02-09
49
3.4 Huffman Coding - Greedy Method
17:33
2018-02-08
50
3.2 Job Sequencing with Deadlines - Greedy Method
13:29
2018-02-07
51
3.3 Optimal Merge Pattern - Greedy Method
9:33
2018-02-07
52
3.1 Knapsack Problem - Greedy Method
15:30
2018-02-06
53
3. Greedy Method - Introduction
12:02
2018-02-06
54
2.9 Strassens Matrix Multiplication
23:40
2018-02-06
55
2.8.2 QuickSort Analysis
11:37
2018-02-02
56
2.8.1 QuickSort Algorithm
13:43
2018-02-02
57
2.7.3 MergeSort in-depth Analysis
13:28
2018-02-01
58
1.5.3 Time Complexity of While and if #3
21:54
2018-02-01
59
2.7.2. Merge Sort Algorithm
20:23
2018-01-31
60
2.7.1 Two Way MergeSort - Iterative method
20:19
2018-01-31
61
2.6.1 Binary Search Iterative Method
19:36
2018-01-29
62
2.6.2 Binary Search Recursive Method
7:11
2018-01-29
63
2.4.2 Examples for Master Theorem #2
5:41
2018-01-26
64
2.4.1 Masters Theorem in Algorithms for Dividing Function #1
16:50
2018-01-26
65
2.5 Root function (Recurrence Relation)
5:37
2018-01-26
66
2.3.3 Recurrence Relation [ T(n)= 2T(n/2) +n] #3
11:20
2018-01-26
67
2.3.2 Recurrence Relation Dividing [ T(n)=T(n/2)+ n]. #2
7:26
2018-01-26
68
2.3.1 Recurrence Relation Dividing Function T(n)=T(n/2)+1 #1
8:41
2018-01-24
69
2.2 Masters Theorem Decreasing Function
8:10
2018-01-24
70
2.1.4 Recurrence Relation T(n)=2 T(n-1)+1 #4
10:42
2018-01-24
71
2.1.3 Recurrence Relation (T(n)= T(n-1) + log n) #3
12:25
2018-01-23
72
2.1.2 Recurrence Relation (T(n)= T(n-1) + n) #2
16:00
2018-01-23
73
2.1.1 Recurrence Relation (T(n)= T(n-1) + 1) #1
13:43
2018-01-22
74
2 Divide And Conquer
7:04
2018-01-22
75
1.11 Best Worst and Average Case Analysis
18:56
2018-01-21
76
1.10.2 Comparison of Functions #2
10:26
2018-01-19
77
1.10.1 Comparison of Functions #1
9:28
2018-01-19
78
1.9 Properties of Asymptotic Notations
11:58
2018-01-19
79
1.8.2 Asymptotic Notations - Big Oh - Omega - Theta #2
10:07
2018-01-18
80
1.8.1 Asymptotic Notations Big Oh - Omega - Theta #1
15:46
2018-01-18
81
1.7 Compare Class of Functions
5:11
2018-01-18
82
1.6 Classes of functions
3:10
2018-01-18
83
1.5.2 Time Complexity Example #2
14:13
2018-01-18
84
1.5.1 Time Complexity #1
9:44
2018-01-18
85
1.4 Frequency Count Method
12:22
2018-01-18
86
1.3 How Write and Analyze Algorithm
10:37
2018-01-18
87
1.2 Characteristics of Algorithm
5:37
2018-01-18
88
1. Introduction to Algorithms
11:49
2018-01-18
89
Why Object Orientation - Hindi
25:07
2017-01-05
90
Java AWT Listeners Coding Styles #7
17:35
2017-01-02
91
Java AWT Coding Styles #6
8:00
2017-01-01
92
Java AWT Event Listeners #5
6:03
2017-01-01
93
Java AWT Event Classes #4
11:06
2017-01-01
94
Java AWT Event Handling #3
8:48
2017-01-01
95
Java AWT Simple App #2
8:54
2016-12-31
96
Java AWT - #1
20:30
2016-12-30
97
How Java is Platform Independent
10:23
2016-12-29
98
Shortest Path Algorithms (Dijkstra and Bellman-Ford) - Simplified
26:13
2016-12-22
99
Websites vs WebApps
15:09
2016-03-07
100
BFS DFS - Simplified
19:13
2015-10-23
101
Asymptotic Notations - Simplified
22:44
2015-09-17
102
Row-Major and Column-Major Mapping
19:16
2015-09-16
103
Pointer to Array
14:36
2015-09-16
104
Hashing Technique - Simplified
17:04
2015-09-16
105
Pointer Arithmetic - *p++; *++p; ++*p;
10:25
2015-09-15
106
Why Pointers?
9:13
2015-09-15
107
Merge Sort Algorithm - Hindi
16:38
2015-09-10
108
Tree Traversal
6:15
2015-09-08
109
Stack vs Heap
11:09
2015-09-08
110
Tower of Hanoi Problem - Made Easy
9:32
2014-05-07
111
Middleware Technologies Explained in Hindi
27:07
2014-05-07
112
Recursion and Stack - English
13:09
2014-05-05
113
Model View Controller ( MVC ) - Explained in Hindi
16:57
2014-05-01
114
Cloud Computing Benefits - Hindi - # 4
15:20
2014-04-30
115
Cloud Computing Services - Hindi - #3
16:25
2014-04-29
116
Cloud Computing - Hindi - #2
17:43
2014-04-22
117
Cloud Computing - Hindi - #1
13:25
2014-04-20
