GATE DA 2025 Set 1 — Question 58

Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.
MSQ+2 / -0MediumGraph TerminologyGraphsProgramming, Data Structures & AlgorithmsBFS Shortest Path

Programming, Data Structures & Algorithms → Graphs → BFS Shortest Path

Last updated

Question

Let GG be a simple, unweighted, and undirected graph. A subset of the vertices and edges of GG are shown below.
A subset of vertices and edges of graph G showing vertices a, b, c, d in one row and e, f, g, h in another, with some edges between them.
It is given that abcda - b - c - d is a shortest path between aa and dd; efghe - f - g - h is a shortest path between ee and hh; afcha - f - c - h is a shortest path between aa and hh. Which of the following is/are NOT the edges of GG?
Your answer

Select all that apply, then check your answer.

The solution stays hidden until you check.

Continue learning with Success Tracker

A step still unclear? Work through it with support

Use Success Tracker to ask about the reasoning, then try another GATE DA question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans
PYQs with solutions
Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts
Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support
Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.

More questions on Graphs