Starting a new Lecture Notes Series on Data Structures(DS) Full Course
Youtube Lecture Playlist CreditsChannel Name: Easy Engineering Classes
So Let Us Start to This Journey of Learning
Data Structures(DS) Full Course By Lecture Notes together!
Lecture 49: L54: B+ Tree Introduction | Example of Inserting Data Elements in B+ Tree | Data Structures Hindi
Lecture 50: L55: Introduction to Graph Theory | Types of Graph | Graph Terms | Data Structures Lectures in Hindi
Lecture 51: L56: Graph Representation | Adjacency Matrix, Adjacency List | Examples | Data Structures Lectures
Lecture 52: L57: Graph Traversal | Breadth First Search(BFS) Traversal | Example | Data Structures Lectures
Lecture 53: L58: Graph Traversal | Depth First Search(DFS) Traversal | Example | Data Structures Lectures Hindi
Lecture 54: L59: BFS, DFS Graph Traversals | Breadth First Search, Depth First Search | Practice Problems
Lecture 55: L60: Topological Sort | Topological Ordering of Graph with Examples | Data Structures Lectures Hindi
Lecture 56: L61: Prims Algorithm for Minimum Spanning Tree(MST) | Greedy Method | Data Structures Lectures Hindi
Lecture 57: L62: Kruskals Algorithm for Minimum Spanning Tree(MST) | Greedy Method | Data Structures Lectures
Lecture 58: L63: Dijkstra Algorithm | Single Source Shortest Path | Greedy Method | Data Structures Lectures
Lecture 59: L64: Bellman Ford Algorithm | Single Source Shortest Path | Dynamic Programming | Data Structures
Lecture 60: L66: Selection Sort Algorithm | Complexity | Example | Data Structures Lectures in Hindi
Lecture 63: L69: Practice Problem on Shell Sort Algorithm | Question on Sorting Elements | Data Structures
Lecture 69: L75: Hashing Techniques | Hash Function | Types of Hashing Techniques | Data Structures Lectures
Lecture 70: L76: Collision Resolution | Types of Collision Resolution Techniques with Example | Data Structures
Lecture 71: 1D Introduction, Finding Address of Linear Array in Memory, Array Initialization Example
Lecture 72: Array Operations – Traversal, Inserting Data and Deleting Data from Array in Hindi and English
Lecture 75: 2D Array Representation in Memory – COLUMN MAJOR ORDER with Example in Hindi and English
Lecture 76: Sparse Matrix – Representation using 3 Column Technique with Example in Hindi and English
Lecture 77: Sparse Matrix – Representation using Linked List Technique with Example in Hindi and English
Lecture 78: Dijkstra's Algorithm for Shortest Path Problem with Example | #DataStructure Lectures in Hindi
Lecture 79: Solved Question on Finding Resulting Binary Tree when one element with two child are deleted
Lecture 81: Graph Theory - Part 2(Types of Graphs) in with example | #DataStructure Lectures in Hindi
Lecture 84: Practice Problem on Creating Adjacency Matrix from Given Set of Vertices and Edges | #DSLectures
Lecture 86: Prim's algorithm for Minimum Spanning Tree with Example | #DataStructure Lectures in Hindi
Lecture 87: Kruskal algorithm for Minimum Spanning Tree with Example | #DataStructure Lectures in Hindi
Lecture 88: Data Structure Solved Question P1 - Problems on Circular Queue, Undirected Graph, Binary Tree, BST
Lecture 89: Data Structure Solved Questions P2 - MST, Connected Planar Graph, Find Binary Tree Number of Nodes