DATA STRUCTURE
A list of video lectures
A list of video lectures
- Dijkstra’s Algorithm
- Dijkstra’s Algorithm
- Dijkstra’s Algorithm example 2
- Quick Sort
- Minimization of DFA
- Mealy to Moore Conversion
- Moore to Mealy conversion
- Adjacency Matrix
- Adjacency List
- Prim’s algorithm | Minimum Spanning Tree Ex. 05
- Prim’s algorithm | Minimum spanning tree Ex. 03
- Prim’s algorithm | Minimum spanning tree Ex. 04
- Prim’s algorithm | Minimum spanning tree Ex. 02
- Kruskal’s Algorithm | Minimum spanning tree Ex. 03
- Dynamic Programming
- Tree Introduction
- Algorithm
- Algorithm Analysis
- Algorithm Writing
- Space complexity
- Time complexity
- Static Memory Allocation
- Dynamic Memory Allocation
- Linked List
- Linked List creation
- Linked list traversal
- Stack push operation
- Stack Introduction
- Stack Pop operations
- Linear search
- Queue deletion
- Queue insertion
- Dijkstra Algorithm : Single Source Shortest Path
- Prims Kruskal algorithm, Adjancy matrix list, BFS, DFS
- Merge Sort
- Selection Sort
- Row Major Order
- Heap | Max Heap | Mean Heap
- Bubble Sort
- Binary Tree
- Insertion Sort
- AVL Tree | Height Balancing Tree | HBL
- Tree Traversal | Inorder | Preorder | Postorder
- Binary Search Tree | BST
- Infix to Postfix expression Stack method