algorithm-design
GATE CSE & IT · Graph Algorithms · 1997-2026
Study anchor
Cormen et al. — Introduction to Algorithms (CLRS)
Algorithms, data structures, graph algorithms, complexity
Practice action
Start latest PYQPYQs in this concept
All concepts →Consider an array $A$ of integers of size $n$. The indices of $A$ run from 1 to $n$. An algorithm is to be designed to check whether $A$ satisfies the condition given below. $\fora...
Consider the following table : Algorithms Design Paradigms (P) Kruskal (ii) Greedy (Q) Quicksort (i) Divide and Conquer (R) Floyd–Warshall (iii) Dynamic Programming Match the algor...
Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph?
The correct matching for the following pairs is A. All pairs shortest path 1. Greedy B. Quick Sort 2. Depth-First Search C. Minimum weight spanning tree 3. Dynamic Programming D. C...