Quadratic Probing Hash Table – Quadratic Probing Collision – Quadratic Probing in Data Structures
Quadratic Probing – Explanation with Example Quadratic Probing is a collision resolution technique used in open addressing. Instead of checking […]
Data Structures and Algorithms
This category contains posts about Data Structures and Algorithms.
Linear Probing Hash Table – Linear Probing Collision – Linear Probing in Data Structures
Linear Probing Explained with Example Definition:Linear Probing is a collision resolution technique in open addressing where, when a collision occurs,
Collision Resolution Techniques in Hashing – Separate Chaining Hash Table – Coding With Clicks
Collision Resolution Techniques in Hashing When two keys hash to the same index in a hash table, a collision occurs.
Collision Resolution Techniques in Hashing – Open Addressing Hash Table – Coding With Clicks
Collision Resolution Techniques in Hashing When two keys hash to the same index in a hash table, a collision occurs.
Hashing in Data Structure – Hashing in DSA – Hash Table – Hash Function – Collisions – Load Factor
Hashing: Concept & Explanation Hashing is a technique used in computer science to store and retrieve data efficiently. It involves
Prim’s Algorithm | Prim’s Algorithm in Data Structure | Prim’s Algorithm for minimum spanning trees
Prim’s Algorithm – Minimum Spanning Tree (MST) Prim’s Algorithm is a greedy algorithm used to find the Minimum Spanning Tree
Kruskal’s Algorithm for Minimum Spanning Trees Kruskal’s Algorithm in Data Structure – DSA Course
Kruskal’s Algorithm (Minimum Spanning Tree – MST) Kruskal’s Algorithm is a greedy algorithm used to find the Minimum Spanning Tree
Floyd Warshall Algorithm – Floyd Warshall Algorithm in Data Structure – Floyd Warshall Algorithm in Graph Theory
Floyd-Warshall Algorithm The Floyd-Warshall Algorithm is an efficient way to find the shortest paths between all pairs of nodes in
Bellman ford algorithm | Bellman ford algorithm in daa | Bellman ford algorithm shortest path
The Bellman-Ford Algorithm is used to find the shortest path from a single source vertex to all other vertices in
Dijkstra Algorithm in Data Structure – Dijkstra Algorithm Shortest Path – Dijkstra Algorithm Example
Dijkstra’s algorithm finds the shortest path from a source vertex to all other vertices in a weighted graph with non-negative
Graph Algorithms – Shortest Path Algorithms (Dijkstra, Bellman-Ford) – MST (Kruskal, Prim’s) – Cycle Detection – Topological Sorting
Common Graph Algorithms 2. Minimum Spanning Tree (MST): 3. Cycle Detection: 4. Topological Sorting: 5. Connected Components:
Spanning Tree in Data Structure | Minimum Spanning Tree in Data Structure | Spanning Tree vs Minimum Spanning Tree
Spanning Tree A spanning tree is a sub-graph of a graph (undirected & connected), which includes all the vertices of
Graph Traversal in Data Structure | Graph Traversal BFS and DFS | BFS and DFS in Data Structure
Graph Traversal Techniques Graph traversal involves visiting all the vertices and edges in a graph. Common traversal techniques include: 2.
Graph Representation in Data Structure – Adjacency Matrix – Adjacency List – Edge List
Graph Representation Graphs can be represented in various ways: Matrix Representation: The adjacency matrix is a V×V table where: 2.
Types of Graphs in Data Structure – Directed vs Undirected – Cyclic vs Acyclic – Sparse vs Dense
Types of Graphs 2. Weighted vs. Unweighted Graphs: 3. Cyclic vs. Acyclic Graphs: 4. Sparse vs. Dense Graphs: 5. Special
Introduction of Graphs in Data Structure – Graph in Data Structure Terminology – Coding With Clicks
Graphs in Data Structures and Algorithms (DSA) A graph is a non-linear data structure consisting of nodes (also called vertices)
Priority Queue – Priority Queue C++ – Priority Queue in Data Structure – Coding With Clicks
A Priority Queue is a special type of queue in which elements are arranged based on their priority. Unlike a
Circular Queue Using Array – Circular Queue in DSA C++ – Circular Queue Operations in Data Structure
A Circular Queue is a type of queue data structure where the last position is connected back to the first