Video recording for online classes in Programming in C++, Data Structures and Design and Analysis of Algorithms Lectures
Can find almost all the topics for B.tech, MCA and M.Tech syllabus.

ADSA Sequence Alignment using Dynamic Programming + Algorithm + Complexity + solved example stepwise
25:37
ADSA Sequence Alignment using Dynamic Programming + Algorithm + Complexity + solved example stepwise
ADSA Sequence Alignment Problem definition + matching + alignment meaning
16:48
ADSA Sequence Alignment Problem definition + matching + alignment meaning
DS Polynomial addition subtraction using linked lists, example + code
21:47
DS Polynomial addition subtraction using linked lists, example + code
DS/DAA Transitive closure of a graph + Reachability Matrix DP approach, algorithm + complexity + eg.
22:50
DS/DAA Transitive closure of a graph + Reachability Matrix DP approach, algorithm + complexity + eg.
DS Activity Networks & Critical Paths, Earliest start time EST, Latest Start time LST, Float example
19:29
DS Activity Networks & Critical Paths, Earliest start time EST, Latest Start time LST, Float example
ADSA Subset Sum Problem using Dynamic Programming (DP) approach
14:01
ADSA Subset Sum Problem using Dynamic Programming (DP) approach
ADSA indegree outdegree, Degree distribution in a graph- probability of a node with degree k
14:33
ADSA indegree outdegree, Degree distribution in a graph- probability of a node with degree k
ADSA degree of a graph, average degree
8:53
ADSA degree of a graph, average degree
Example of minimum cut In a graph using flow networks
20:49
Example of minimum cut In a graph using flow networks
Min Cut using flow networks Example
7:43
Min Cut using flow networks Example
ADSA Bipartite Matching using flow networks
5:44
ADSA Bipartite Matching using flow networks
ADSA clustering coefficient in graphs
6:13
ADSA clustering coefficient in graphs
ADSA CONNECTEDNESS - DFS for finding connected components in a graph
14:39
ADSA CONNECTEDNESS - DFS for finding connected components in a graph
ADSA Paths and Distances- Network Diameter, Average Distance in a graph
12:57
ADSA Paths and Distances- Network Diameter, Average Distance in a graph
Airline scheduling example using maximum flow networks
15:32
Airline scheduling example using maximum flow networks
Circulation with demands and lower bounds - application of maximum flow network
17:40
Circulation with demands and lower bounds - application of maximum flow network
Extension of maximum flow networks - Circulation with Demands - solved example
20:10
Extension of maximum flow networks - Circulation with Demands - solved example
Python: Data types- numbers, sequences ( list, tuple, strings), sets, dictionaries
25:34
Python: Data types- numbers, sequences ( list, tuple, strings), sets, dictionaries
Python: identifiers/ variables and Data Types
19:29
Python: identifiers/ variables and Data Types
Introduction to Python
12:35
Introduction to Python
ADSA Image Segmentation using Flow Networks - solved example
8:00
ADSA Image Segmentation using Flow Networks - solved example
ADSA Image Segmentation using Flow Networks - from scratch to detail
31:47
ADSA Image Segmentation using Flow Networks - from scratch to detail
ADSA : Min Cut Theorem Ford Fulkerson Algo, Flow Networks
30:13
ADSA : Min Cut Theorem Ford Fulkerson Algo, Flow Networks
DAA Subset sum problem using Backtracking
19:08
DAA Subset sum problem using Backtracking
DAA Backtracking - introduction using MAZE example + Hamiltonian cycle problem solved using example
22:22
DAA Backtracking - introduction using MAZE example + Hamiltonian cycle problem solved using example
DAA 1.6.3 HEAP SORT algorithm and complexity - max Heapify + build heap example
17:58
DAA 1.6.3 HEAP SORT algorithm and complexity - max Heapify + build heap example
DAA 1.6.1 BUILD HEAP() + max Heapify
12:18
DAA 1.6.1 BUILD HEAP() + max Heapify
DAA 1.6.0 What is HEAP, max heap- min heap, MAX HEAPIFY with example
22:04
DAA 1.6.0 What is HEAP, max heap- min heap, MAX HEAPIFY with example
DS 3.8 Priority Queues - Array implementation as Multiple Queues + Heap Implementation
9:22
DS 3.8 Priority Queues - Array implementation as Multiple Queues + Heap Implementation
DS 3.7 Priority queue - Introduction, implementation, insertion
29:30
DS 3.7 Priority queue - Introduction, implementation, insertion