Канал: Shweta Singhal

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

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

ADSA Sequence Alignment Problem definition + matching + alignment meaning

ADSA Sequence Alignment Problem definition + matching + alignment meaning

DS Polynomial addition subtraction using linked lists, example + code

DS Polynomial addition subtraction using linked lists, example + code

DS/DAA Transitive closure of a graph + Reachability Matrix DP approach, algorithm + complexity + eg.

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

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 Subset Sum Problem using Dynamic Programming (DP) approach

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

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

ADSA degree of a graph, average degree

ADSA degree of a graph, average degree

Example of minimum cut In a graph using flow networks

Example of minimum cut In a graph using flow networks

Min Cut using flow networks Example

Min Cut using flow networks Example

ADSA Bipartite Matching using flow networks

ADSA Bipartite Matching using flow networks

ADSA clustering coefficient in graphs

ADSA clustering coefficient in graphs

ADSA CONNECTEDNESS - DFS for finding connected components in a graph

ADSA CONNECTEDNESS - DFS for finding connected components in a graph

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

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

Airline scheduling example using maximum flow networks

Airline scheduling example using maximum flow networks

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

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

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

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

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

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

Python: identifiers/ variables and Data Types

Python: identifiers/ variables and Data Types

Introduction to Python

Introduction to Python

ADSA Image Segmentation using Flow Networks - solved example

ADSA Image Segmentation using Flow Networks - solved example

ADSA Image Segmentation using Flow Networks - from scratch to detail

ADSA Image Segmentation using Flow Networks - from scratch to detail

ADSA : Min Cut Theorem Ford Fulkerson Algo, Flow Networks

ADSA : Min Cut Theorem Ford Fulkerson Algo, Flow Networks

DAA Subset sum problem using Backtracking

DAA Subset sum problem using Backtracking

DAA Backtracking - introduction using MAZE example + Hamiltonian cycle problem solved using example

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

DAA 1.6.3 HEAP SORT algorithm and complexity - max Heapify + build heap example

DAA 1.6.1 BUILD HEAP() + max Heapify

DAA 1.6.1 BUILD HEAP() + max Heapify

DAA 1.6.0 What is HEAP, max heap- min heap, MAX HEAPIFY with example

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

DS 3.8 Priority Queues - Array implementation as Multiple Queues + Heap Implementation

DS 3.7 Priority queue - Introduction, implementation, insertion

DS 3.7 Priority queue - Introduction, implementation, insertion

DS 3.4 Application of Queues - real life examples

DS 3.4 Application of Queues - real life examples

DS 3.6 Types of Queues

DS 3.6 Types of Queues

DS 4.2 Deletion in a B Tree

DS 4.2 Deletion in a B Tree

DS 4.1 B tress M-way trees introduction + Properties + Insertion in a B Tree

DS 4.1 B tress M-way trees introduction + Properties + Insertion in a B Tree

DS 3.5 Queues Insertion/ Deletion/ Traversal -Implementation as Arrays and Linked List

DS 3.5 Queues Insertion/ Deletion/ Traversal -Implementation as Arrays and Linked List

DS 3.3 Converting Infix to Prefix using stacks

DS 3.3 Converting Infix to Prefix using stacks

DS 3.4 Evaluating expression postfix using stack

DS 3.4 Evaluating expression postfix using stack

DS 3.1 Introduction to STACKS - implementation using Arrays and Linked lists - Push() Pop Traverse()

DS 3.1 Introduction to STACKS - implementation using Arrays and Linked lists - Push() Pop Traverse()

DS 3.2 Conversion Infix to Postfix expression using stacks

DS 3.2 Conversion Infix to Postfix expression using stacks

DS 2.3 Doubly Linked List Insertion at beginning, end, in between + traversal

DS 2.3 Doubly Linked List Insertion at beginning, end, in between + traversal

DS 2.1 Linked List Deletion - singly LL

DS 2.1 Linked List Deletion - singly LL

DS 1.3.1 Linear search + Binary Search + complexity

DS 1.3.1 Linear search + Binary Search + complexity

DS 1.3.2 Interpolation Search Technique + complexity

DS 1.3.2 Interpolation Search Technique + complexity

DS 1.11 Comparison of sorting techniques_time / space complexity, in-place, stable, online sorting

DS 1.11 Comparison of sorting techniques_time / space complexity, in-place, stable, online sorting

DS 1.4 Bubble Sort - Sorting Techniques

DS 1.4 Bubble Sort - Sorting Techniques

DS 1.5 Selection Sort

DS 1.5 Selection Sort

DS 1.6 Insertion Sort - Algorithm + best case/ worst case time complexity

DS 1.6 Insertion Sort - Algorithm + best case/ worst case time complexity

DS 1.7 Merge Sorting -Divide and Conquer Approach - O(nlogn) complexity

DS 1.7 Merge Sorting -Divide and Conquer Approach - O(nlogn) complexity

DS 1.8 Quick Sort / Sorting Techniques with best case - worst case Complexities explained

DS 1.8 Quick Sort / Sorting Techniques with best case - worst case Complexities explained

DS 1.9 Heap Sort - Heapify - Build Max Heap - Heap Sort

DS 1.9 Heap Sort - Heapify - Build Max Heap - Heap Sort

DS 1.10 Heap data structure_insertion in a heap. Deletion in a heap

DS 1.10 Heap data structure_insertion in a heap. Deletion in a heap

DS 2.0 Introduction to Linked Lists - Singly Linked List Insertion in beginning, at end, in between

DS 2.0 Introduction to Linked Lists - Singly Linked List Insertion in beginning, at end, in between

DS 1.2 Arrays - Insertion at beginning, end, in between

DS 1.2 Arrays - Insertion at beginning, end, in between

DS 1.1 Introduction to time/space complexity and asymptotic notations

DS 1.1 Introduction to time/space complexity and asymptotic notations

DS 1.0 Introduction to Data Structures, What, why, Types of Data Structures

DS 1.0 Introduction to Data Structures, What, why, Types of Data Structures

DAA 1.2.1 Introduction to recurrence relations_easy time complexity_recursive tree method

DAA 1.2.1 Introduction to recurrence relations_easy time complexity_recursive tree method

Generic Programming -Class template with multiple parameters

Generic Programming -Class template with multiple parameters

Exception Handling - List of Exceptions a function can throw

Exception Handling - List of Exceptions a function can throw

Exception Handling - Rethrowing an exception/ throwing same type of exception

Exception Handling - Rethrowing an exception/ throwing same type of exception

Function Templates - Generic Programming

Function Templates - Generic Programming

Class Templates - Generic Programming

Class Templates - Generic Programming

Operator Overloading in C++ - Class member functions / friend function, +, * , input-output operator

Operator Overloading in C++ - Class member functions / friend function, +, * , input-output operator

Concept of Recursion with real life examples _ revision in C++

Concept of Recursion with real life examples _ revision in C++

Virtual function question runtime polymorphism example _Revision

Virtual function question runtime polymorphism example _Revision

Modes of a file : File Handling in C++

Modes of a file : File Handling in C++

File pointers and manipulation : seekg(), seekp(), tellg(), tellp()

File pointers and manipulation : seekg(), seekp(), tellg(), tellp()

Read() and write() class objects to file_Binary files _ File Handling C++

Read() and write() class objects to file_Binary files _ File Handling C++

Updating a file: random access_File Handling C++

Updating a file: random access_File Handling C++

Command line arguments and file handling in C++

Command line arguments and file handling in C++

Error Handling during file operations in C++ _eof(), fail(), bad(), good()

Error Handling during file operations in C++ _eof(), fail(), bad(), good()

Introduction to file handling in C++ _ file streams

Introduction to file handling in C++ _ file streams

Virtual functions- Runtime polymorphism in C++

Virtual functions- Runtime polymorphism in C++

Pointers to derived class in C++

Pointers to derived class in C++

This pointer with example in C++

This pointer with example in C++

Array of Pointers to objects in C++

Array of Pointers to objects in C++

Pointer to objects in C++

Pointer to objects in C++

Destructors in C++

Destructors in C++

Iterative Merge Sorting in C++

Iterative Merge Sorting in C++

Dynamic Constructors - 2D arrays at runtime

Dynamic Constructors - 2D arrays at runtime

Copy Constructor in C++

Copy Constructor in C++

Dynamic memory allocation - new delete operators in C++

Dynamic memory allocation - new delete operators in C++

Constructors in C++ - default constructor, parametrised constructor

Constructors in C++ - default constructor, parametrised constructor

Pointers and 2D arrays - eg. matrix multiplication using pointers

Pointers and 2D arrays - eg. matrix multiplication using pointers

Pointers as Arrays_eg. insertion in array using pointers

Pointers as Arrays_eg. insertion in array using pointers

Function pointers / passing functions as arguments to another function

Function pointers / passing functions as arguments to another function

Array of function pointers

Array of function pointers

Reverse a string using pointers in C++

Reverse a string using pointers in C++

Pointers and 3D arrays

Pointers and 3D arrays

Sum of digits of a number Using Recursion in C++

Sum of digits of a number Using Recursion in C++

Towers of Hanoii solved using recursion in C/C++

Towers of Hanoii solved using recursion in C/C++

Pointer to array in C/C++

Pointer to array in C/C++

Array of Pointers in C/C++ - example print the day of the week

Array of Pointers in C/C++ - example print the day of the week

Constant pointer to constant data

Constant pointer to constant data

Storage classes / specifiers - auto / register / extern / static variables

Storage classes / specifiers - auto / register / extern / static variables

Constant pointers and Pointers to constant

Constant pointers and Pointers to constant

Types of Recursion

Types of Recursion

Fibonacci series using recursion in C++

Fibonacci series using recursion in C++

Recursion and recursive functions in c++

Recursion and recursive functions in c++

Polymorphism - function overloading

Polymorphism - function overloading

Namespace in C++ (using namespace std explained)

Namespace in C++ (using namespace std explained)

Bitwise operators in C++

Bitwise operators in C++

Types of errors in C or C++

Types of errors in C or C++

Rabin Karp String Matching (RKP) Algorithm

Rabin Karp String Matching (RKP) Algorithm

Branch and Bound - 0 1 knapsack using branch & bound

Branch and Bound - 0 1 knapsack using branch & bound

Passing arguments to functions using pointers, pointer arithmetic intro

Passing arguments to functions using pointers, pointer arithmetic intro

Type Conversion and Type casting in C/C++

Type Conversion and Type casting in C/C++

Optimal BST easy and quick solution for exams

Optimal BST easy and quick solution for exams

Clique Problem NPComplete proof

Clique Problem NPComplete proof

NP class NP hard NPComplete Introduction

NP class NP hard NPComplete Introduction

NQueens Problem using Backtracking Approach

NQueens Problem using Backtracking Approach

Concept of Pointers (Declaring, dereferencing, size, arithmetics)

Concept of Pointers (Declaring, dereferencing, size, arithmetics)

Null Pointer and Generic Pointer

Null Pointer and Generic Pointer

What is pointers C++

What is pointers C++

switch case statement in C++

switch case statement in C++

Concept of memory (Pointers)

Concept of memory (Pointers)

array as parameters

array as parameters

Floyd Warshall Example

Floyd Warshall Example

2D arrays, row major column major order Address Calculations

2D arrays, row major column major order Address Calculations

easy DFS Algorithm + Example + Complexity

easy DFS Algorithm + Example + Complexity

Strongly connected Components using DFS

Strongly connected Components using DFS

Strongly connected components example_DFS Application

Strongly connected components example_DFS Application

Topological sort using DFS explained

Topological sort using DFS explained

DFS ALGORITHM and COMPLEXITY

DFS ALGORITHM and COMPLEXITY

Multiplying two Complex numbers using 3 scalar calculations

Multiplying two Complex numbers using 3 scalar calculations

Topological sort algorithm without DFS

Topological sort algorithm without DFS

Bellman Ford algorithm and example

Bellman Ford algorithm and example

Dijkstra's algorithm

Dijkstra's algorithm

Optimal BST algorithm detailed explanation example

Optimal BST algorithm detailed explanation example

optimal BST quick example

optimal BST quick example

Optimal BST problem and dynamic approach

Optimal BST problem and dynamic approach

$Greedy fractional knapsack$

Greedy fractional knapsack

Intro to greedy activity selection problem

Intro to greedy activity selection problem

job scheduling greedy approach

job scheduling greedy approach

DAA 1.5 Strassens matrix multiplication all in one

DAA 1.5 Strassens matrix multiplication all in one

DAA 1.4 simultaneous MAX MIN problem

DAA 1.4 simultaneous MAX MIN problem

DAA 1.3.9 Heap and Heap Sort example

DAA 1.3.9 Heap and Heap Sort example

DAA 1.3.8 Shell Sort

DAA 1.3.8 Shell Sort

Asymptotic notations and recursive tree method

Asymptotic notations and recursive tree method

DAA 1.0 Introduction to algorithms: what why and importance

DAA 1.0 Introduction to algorithms: what why and importance

growth of functions and substitution method examples

growth of functions and substitution method examples

DAA 3.6 Prim's MST Algorithm

DAA 3.6 Prim's MST Algorithm

DAA 3.5 Kruskal's MST algorithm

DAA 3.5 Kruskal's MST algorithm

DAA 3.1 Breadth First Search Algorithm

DAA 3.1 Breadth First Search Algorithm

DAA 3.2 Depth First Search Algorithm (DFS)

DAA 3.2 Depth First Search Algorithm (DFS)

DAA 3.7 Dijkstra Algorithm

DAA 3.7 Dijkstra Algorithm

DAA 3.8 Bellman Ford algorithm

DAA 3.8 Bellman Ford algorithm

DAA 4.6 NP formula and circuit satisfiability NP completeness proof

DAA 4.6 NP formula and circuit satisfiability NP completeness proof

DAA 4.5 NP complete introduction

DAA 4.5 NP complete introduction

DAA 4.4 String Matching using Finite Automata

DAA 4.4 String Matching using Finite Automata

DAA 4.3 Knuth Morris Pratt algorithm (KMP string matching Algorithm)

DAA 4.3 Knuth Morris Pratt algorithm (KMP string matching Algorithm)

DAA 4.1 Naive string matching algorithm

DAA 4.1 Naive string matching algorithm

DAA 2.2.6.2 Optimal BST DP Example

DAA 2.2.6.2 Optimal BST DP Example

DAA 2.3.2 Huffman Coding Greedy Approach

DAA 2.3.2 Huffman Coding Greedy Approach

DAA 2.2.6 Optimal Binary Search Tree _DP

DAA 2.2.6 Optimal Binary Search Tree _DP

DAA 2.3.1 Greedy Activity Selection Problem

DAA 2.3.1 Greedy Activity Selection Problem

DAA 2.3.3 Task Scheduling Problem Greedy approach / job sequencing problem

DAA 2.3.3 Task Scheduling Problem Greedy approach / job sequencing problem

DAA 2.2.5 0/1 knapsack problem using dynamic programming

DAA 2.2.5 0/1 knapsack problem using dynamic programming

DAA 2.2.4 0/1 and Fractional Knapsack using Greedy Approach

DAA 2.2.4 0/1 and Fractional Knapsack using Greedy Approach

DAA 2.2.3 Longest Common Subsequence LCS_DP

DAA 2.2.3 Longest Common Subsequence LCS_DP

DAA 2.2.2 Matrix Chain Multiplication

DAA 2.2.2 Matrix Chain Multiplication

DAA 1.3.7 Median and Order Statistics - Part 2

DAA 1.3.7 Median and Order Statistics - Part 2

DAA 2.2.1 Matrix Chain Multiplication problem definition

DAA 2.2.1 Matrix Chain Multiplication problem definition

DAA 2.1 Introduction to Dynamic Programming

DAA 2.1 Introduction to Dynamic Programming

DAA 1.3.6 Median and order statistics Part 1

DAA 1.3.6 Median and order statistics Part 1

DAA 1.3.5 Strassens matrix multiplication trick

DAA 1.3.5 Strassens matrix multiplication trick

DAA 1.3.4 Strassen's matrix multiplication part 2

DAA 1.3.4 Strassen's matrix multiplication part 2

DAA 1.3.3 strassens matrix multiplication part 1

DAA 1.3.3 strassens matrix multiplication part 1

DAA 1.3.2 merge sort and quick sort - part 2

DAA 1.3.2 merge sort and quick sort - part 2

DAA 1.3.1 divide and conquer merge sort

DAA 1.3.1 divide and conquer merge sort

DAA 1.1.2 Asymptotic Notations - part 2

DAA 1.1.2 Asymptotic Notations - part 2

DAA 1.2.5 Masters Theorem

DAA 1.2.5 Masters Theorem

DAA 1.2.4 Recurrence relations iteration and recursive tree method examples

DAA 1.2.4 Recurrence relations iteration and recursive tree method examples

DAA 1.2.3 recursive relations Iteration Method

DAA 1.2.3 recursive relations Iteration Method

DAA 1.1.3 Analysing control structures - part 3

DAA 1.1.3 Analysing control structures - part 3

DAA 1.1.1 Growth of functions - Part 1

DAA 1.1.1 Growth of functions - Part 1

DAA 1.2.2 Substitution method examples

DAA 1.2.2 Substitution method examples

DAA 1.2.1 Intro to recursive relations

DAA 1.2.1 Intro to recursive relations

garbage collection

garbage collection

reading data from files in C

reading data from files in C

DS write data to files in C

DS write data to files in C

DS File organization 2

DS File organization 2

DS File Organization

DS File Organization

DS Error Handling and random access of files in C

DS Error Handling and random access of files in C

DS File Indexing

DS File Indexing

Storage management reference count method

Storage management reference count method

Floyd warshall

Floyd warshall

Graphs Topological sort

Graphs Topological sort

Graphs DFS

Graphs DFS

Binary tree representation-Types-preorder

Binary tree representation-Types-preorder

trees introduction

trees introduction

Graphs BFS traversal

Graphs BFS traversal

Creating a graph

Creating a graph

Graph Representation

Graph Representation

DS AVL trees 2

DS AVL trees 2

hashing 1

hashing 1

Dijkstras algorithm

Dijkstras algorithm

Introducing Graphs

Introducing Graphs

hashing 2

hashing 2

DS AVL Trees 1

DS AVL Trees 1

BST Binary Search Trees

BST Binary Search Trees