Loading previous year questions
Algorithms · Graph Algorithms
Official IIT answer key · IIT Bombay · Audited Aug 2026
GATE CSE 2013 Q19 · MCQ · 1 mark
Key concept
No account needed
Sit 1 related Graph AlgorithmsPYQs as a guest. We'll score the set and show which traps cost marks — sign in only if you want to save the run.
Topic notes
GATE tests fundamental graph algorithms by evaluating their asymptotic time complexity on specific graph structures. In this topic, questions require candidates to combine the standard algorithmic complexity bounds (expressed in terms of vertices |V| and edges |E|) with the structural edge-density properties of particular graph classes, such as complete graphs.
Full Graph Algorithms guide →What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices?
Topic-wise GATE CS PYQs with verified steps
Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.