PRE-READS

Graph 1-1

1. What is a Graph? A graph is a collection of vertices (nodes) connected by edges. It can be directed…

December 12, 2024

PRE-READS

Greedy-3

Greedy Algorithms 1. Huffman Coding Huffman Coding is a popular greedy algorithm used for lossless data compression. It assigns variable-length…

December 12, 2024

PRE-READS

Greedy-2

Greedy Algorithms 1. Activity Selection Problem The Activity Selection Problem is a classic problem that involves selecting the maximum number…

December 12, 2024

PRE-READS

Greedy-1

Greedy Algorithms 1. What is a Greedy Algorithm? A greedy algorithm builds a solution piece by piece, always selecting the…

December 12, 2024

PRE-READS

Minimum Spanning Tree -3

1.Prim’s Algorithm for MST Prim’s Algorithm is another greedy algorithm for finding the Minimum Spanning Tree. Unlike Kruskal’s Algorithm, which…

December 12, 2024

PRE-READS

Minimum Spanning Tree -2

1. Kruskal’s Algorithm for MST Kruskal’s Algorithm is a greedy algorithm used to find the Minimum Spanning Tree. It operates…

December 12, 2024

PRE-READS

Minimum Spanning Tree -1

1. What is a Minimum Spanning Tree (MST)? A Minimum Spanning Tree (MST) of a connected, undirected graph is a…

December 12, 2024

PRE-READS

BFS and DFS 2-2

Comparison of BFS and DFS 1. Key Differences Between BFS and DFS Feature BFS DFS Traversal Order Level by level…

December 12, 2024

PRE-READS

BFS and DFS 2-1

Depth-First Search (DFS) 1. Introduction to DFS Depth-First Search (DFS) is a graph traversal algorithm that explores a graph by…

December 12, 2024