Data Structures (DS) (English)

   Saturday, November 18, 2023   

Starting a new Lecture Notes Series on Data Structures (DS)

Youtube Lecture Playlist Credits 

Channel Name: Education 4u

So Let Us Start to This Journey of Learning 

Data Structures (DS) By Lecture Notes together!

Lecture Description of this above Topic:

Lecture 1: Data Structures | Introduction | Lec-1

Lecture 2: Programming Methodologies | Introduction | Data Structures | Lec-2

Lecture 3: Programming Methodologies | Part-1/2 | Data Structures | Lec-3

Lecture 4: Programming Methodologies | Part-2/2 | Data Structures | Lec-4

Lecture 5: Abstract Data Type | Data Structures | Lec-5

Lecture 6: Arrays | Declare , Create & Initialisation | 1-D & 2-D | Data Structures| Lec-6

Lecture 7: Array representation | Row Major order & Column Major order | Data Structures| Lec-7

Lecture 8: 1-D Array representation | Row Major & Column Major order | Data Structures | Lec-8

Lecture 9: 2-D Array representation | Row Major & Column Major order | Data Structures | Lec-9

Lecture 10: Stack | PUSH, POP | Data Structures | Lec-10

Lecture 11: Stack Abstract Data Type | Insertion & Deletion | Data Structures | Lec-11

Lecture 12: Queues | FIFO & Applications | Data Structures | Lec-12

Lecture 13: Queue as ADT | Enqueue & Dequeue | Data Structures | Lec-13

Lecture 14: nfix Prefix and Postfix | Notations | Data Structures | Lec-14

Lecture 15: Infix to Postfix conversions example | Data Structures | Lec-15

Lecture 16: Infix to Prefix conversion | Examples | Data Structures | Lec-16

Lecture 17: Postfix to Infix Conversion | Examples | Data Structures | Lec-17

Lecture 18: Prefix to Infix Conversion | Examples | Data Structures | Lec-18

Lecture 19: Evaluation of Postfix Expression | Algorithm | Data Structures | Lec-19

Lecture 20: Evaluation of Postfix Expression | Examples | Data Structures | Lec-20

Lecture 21: Evaluation of Prefix expression | Examples | Data Structures | Lec-21

Lecture 22: Linked list | Introduction | Data Structures | Lec-22

Lecture 23: Linked list | Single, Double & Circular | Data Structures | Lec-23

Lecture 24: Sparse Matrix | Array representation | Data Structures | Lec-24

Lecture 25: Sparse Matrix | Linked list representation | Data Structures | Lec-25

Lecture 26: What is Tree | Data Structures | Lec-26

Lecture 27: Binary tree | Recursive & Properties | Data Structures | Lec-27

Lecture 28: Recursive and Implementation of trees | Data Structures | Lec-28

Lecture 29: Binary tree traversal | Preorder , Inorder & Postorder | Data Structures | Lec-29

Lecture 30: Binary Tree Traversal | Preorder | Data Structures | Lec-30

Lecture 31: Binary Tree Traversal | Inorder | Data Structures | Lec-31

Lecture 32: Binary Tree Traversal | Postorder | Data Structures | Lec-32

Lecture 33: Binary Search Tree (BST) | Part-1/2 | Data Structures | Lec-33

Lecture 34: Binary Search Tree (BST) | Part-2/2 | Data Structures | Lec-34

Lecture 35: expression tree | Data Structures | Lec-35

Lecture 36: Binary Search Tree Traversal | In, Pre & Post Order | Data Structures | Lec-36

Lecture 37: Searching in Binary Search Tree | Algo & Example | Data Structures | Lec-37

Lecture 38: Insertion in Binary Search Tree | Algo & Example | Data Structures | Lec-38

Lecture 39: Deletion in Binary Search Tree | Algo & Example | Data Structures | Lec-39

Lecture 40: Avl tree | Introduction | Data Structures | Lec-40

Lecture 41: avl tree rotation examples | Left - Left rotation | Data Structures | Lec-41

Lecture 42: avl tree rotation examples | Left - Right rotation | Data Structures | Lec-42

Lecture 43: avl tree rotation examples | RR & RL rotation | Data Structures | Lec-43

Lecture 44: AVL tree insertion example | Data Structures | Lec-44

Lecture 45: Heap tree | Min & Max heap | Data Structures | Lec-45

Lecture 46: Graph terminology | Data Structures | Lec-46

Lecture 47: Adjacency Matrices | Example | Graph representation | Data Structures | Lec-47

Lecture 48: Incidence matrix | Example | Graph representation | Data Structures | Lec-48

Lecture 49: Adjacency list | Example | Graph representation | Data Structures | Lec-49

Lecture 50: Depth First Search | Also & Example | Graph traversal | Data Structures | Lec-50

Lecture 51: Breadth First Search | Also & Example | Graph traversal | Data Structures | Lec-51

Lecture 52: Sorting | Methods | Data Structures | Lec-52

Lecture 53: Selection Sort example | Straight | Data Structures | Lec-53

Lecture 54: Selection sort algorithm | Straight | Data Structures | Lec-54

Lecture 55: Heap sort example | Data Structures | Lec-55

Lecture 56: Heap sorting algorithm | Data Structures | Lec-56

Lecture 57: Insertion sort example | Straight | Data Structures | Lec-57

Lecture 58: Shell sort example | Insertion | Data Structures | Lec-58

Lecture 59: Bubble sort Example | Exchange Sort | Data Structures | Lec-59

Lecture 60: Quicksort algorithm | Divide & Conquer | Exchange Sort | Data Structures | Lec-60

Lecture 61: Quick sort example | Divide & Conquer | Data Structures | Lec-61

Lecture 62: What is Hashing | Data Structures | Lec-62

Lecture 63: Hashing methods | Introduction | Part-1/4 | Data Structures | Lec-63

Lecture 64: Hashing methods | Direct & Modulo Division | Part-2/4 | Data Structures | Lec-64

Lecture 65: Hashing methods | Digit extraction & Mid square | Part-3/4 | Data Structures | Lec-65

Lecture 66: Hashing methods | Folding , Rotation & Random | Part-4/4 | Data Structures | Lec-66

Lecture 67: Collision Resolution | Linear & Quadratic probing | Data Structures | Lec-67