Minimum Spanning Tree (MST)
đ What is a Spanning Tree? Take a connected graph (a set of points joined by lines).A spanning tree is: …
Algorithms
Graph Traversal Methods
đ What Is Graph Traversal? Imagine youâre exploring a new city.You start from one place and slowly move to nearby …
Shortest Path Algorithm
Shortest Path Algorithm Imagine youâre standing in a new city with several streets connecting different places.You want to reach your …
Warshallâs Algorithm â Graphs
Warshallâs Algorithm Warshallâs Algorithm is a neat trick that answers this question for every pair of vertices in a graph. …
Graph Traversal MCQs For Gate Exam
Graph Traversal MCQs đ Graph Traversals â GATE-Level MCQs (Algorithms) Q1. Breadth-First Search (BFS) uses which data structure?A) StackâB) QueueâC) …
Divide & Conquer MCQs for Algorithm Design Techniques
Divide & Conquer (Algorithm Design Techniques) (Wait: correct: for a=1,b=2, n^{log_b a}=n^0=1; f(n)=n which is polynomially larger â case 3? …
Dynamic Programming (Algorithm Design Techniques) MCQs
Dynamic Programming (Algorithm Design Techniques)
