DAA Subset sum problem using Backtracking

ADSA Sequence Alignment using Dynamic Programming + Algorithm + Complexity + solved example stepwise

ADSA Sequence Alignment Problem definition + matching + alignment meaning

DS Polynomial addition subtraction using linked lists, example + code

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

ADSA Subset Sum Problem using Dynamic Programming (DP) approach

ADSA indegree outdegree, Degree distribution in a graph- probability of a node with degree k

ADSA degree of a graph, average degree

Example of minimum cut In a graph using flow networks

Min Cut using flow networks Example

ADSA Bipartite Matching using flow networks

ADSA clustering coefficient in graphs

ADSA CONNECTEDNESS - DFS for finding connected components in a graph

ADSA Paths and Distances- Network Diameter, Average Distance in a graph

Airline scheduling example using maximum flow networks

Circulation with demands and lower bounds - application of maximum flow network

Extension of maximum flow networks - Circulation with Demands - solved example

Python: Data types- numbers, sequences ( list, tuple, strings), sets, dictionaries

Python: identifiers/ variables and Data Types

Introduction to Python

ADSA Image Segmentation using Flow Networks - solved example

ADSA Image Segmentation using Flow Networks - from scratch to detail

ADSA : Min Cut Theorem Ford Fulkerson Algo, Flow Networks

DAA Subset sum problem using Backtracking