10:16

Introduction to Python programming

08:48

Hash Collision Resolution Technique:Double Hashing

02:34

Hash Collision Resolution:Quadratic Probing

03:16

Hash Collision Resolution Technique:Linier Probing

04:49

Hash Collision Resolution:open Hasing(Chaining)

09:42

Hashing:Key, Hash Table, Hash function

06:51

Heap Sort Algorithm

08:42

Insertion Sort

12:52

Merge Sort Algorithm

11:53

Quick Sort Algorithm

06:48

Bubble Sort Algorithm

06:58

Selection Sort with example

03:55

Interpolation Search Algorithm in DS

03:54

Binary Searching algorithm

05:35

Searching Algorithms in Data Structure//Linear Search

05:15

Prim's Algorithm, Minimum Spanning Tree

08:26

Spanning Tree/Minimum Spanning Tree (MST),Kruskal algorithm

10:11

DFS: Depth First Season

05:36

BFS: Breadth First Search

12:26

What is Graph in DS?//Graph Terminology//Different types of Graph

10:18

Threaded Binary Tree(TBT)

06:16

Difference between B Tree and B+ Tree

11:43

b+ Tree// b+ tree Insertion of order 3

10:58

b tree / Insertion of order 4

17:40

AVL Tree:LL/RR/LR/RL Unbalanced tree//LL/RR/LR/RL Rotations

10:29

BST: Binary Search Tree with Example

12:09

Binary tree //Tree Traversal: preorder, Inorder, Postorder Traversal

07:57

Tree Terminology

13:22

Double Ended Queue (Dequeue) implementation using linked list

14:19

what is Priority Queue?? Types of priority Queue.||Enqueue,dequeue and display operation in pq

22:53

Circular Queue implementation Using Array and Linked List

12:43

Queue implementation using Stack

14:07

Queue Implementation Using Linked List||Enqueue||Dequeue||Peek||Traverse/Display Operation

12:17

What is Queue in Data structure||enqueue, Dequeue, Traverse,peek operation

11:19

Prefix to Postfix and Postfix to Prefix Conversion Using Stack

10:12

Postfix to Infix||Prefix to Infix Conversion using Stack

15:29

Infix to Prefix conversation using Stack

13:36

Infix to Postfix Conversion

10:35

Stack using Array ||push()||pop()||peek()||Traverse/display operations

14:58

Stack using linked list||push()||pop()||peek()||Traverse/display operations

39:13

Double Circular Linked List| Insertions || Deletion || Traverse/Display || Search Operations

29:33

Circular Linked List || Insertions || Deletion || Traverse/Display || Search Operations

34:56

Double Linked List Operations:Insert, Delete, Search, Traverse and display Algorithms and Functions

29:36

Single Linked List Operations:Insert, Delete, Search, Traverse and display Algorithms and Functions

07:33

What is Linked List? Types of Linked List

15:51

Static And Dynamic Memory Allocation/Malloc(),Calloc(),Realloc(),Free()

06:48

What is Data Structure? Classification of Data Structure

09:59

Subtraction using Complements

10:02

Carry look ahead adder

15:26

Binary, Octal and Hexadecimal Addition and Subtraction using easy method

12:43

What is Latch and Flip-flop/Relation between Latch and Flip-flop/Difference between Latch and F-F

17:49

Number System: Number Conversion

18:27

Encoder And Decoder

16:43

Multiplexer and De-multiplexer

19:12

Parity Bit Generator and Parity Bit Checker

15:15

Adder and Subtractor

23:18

Flip-flops:SR,JK,D,T, Master Slave JK Flip-flop with working Principle

15:26

2 bit magnitude comparator design

19:21

Booth's Non-restoring Division//Signed Binary Division

28:31

Booth's Multiplication Algorithm for Signed integer