Success TrackerSuccess Tracker
Log inSign up

GATE CS 2017 Set 2 — Question 15

Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.
MCQ+1 / -0.33MediumBFS TraversalGraphs (Data Structure)Programming & Data Structures

Programming & Data Structures → Graphs (Data Structure) → BFS Traversal

Last updated

Question

The Breadth First Search (BFS) algorithm has been implemented using the queue data structure. Which one of the following is a possible order of visiting the nodes in the graph below?
An undirected graph with 6 nodes: M, N, O in the top row and R, Q, P in the bottom row. Edges: M-N, N-O, M-R, M-Q, N-Q, O-Q, O-P and Q-P.
Your answer

Choose one option, 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 CS 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.

Start with a free accountView plans and allowances

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

More questions on Graphs (Data Structure)

2026 Set 2 Q12The set T represents various traversals over binary tree. The set S represents the order of…2026 Set 2 Q19Consider the following three ANSI-C programs, P1, P2, and P3. P1 [code] P2 [code] **P3**…2026 Set 1 Q23Let nn be an odd number greater than 100. Consider a binary minheap with nn elements stored in an…2026 Set 1 Q24Consider a hash table P[0,1,…,10]P[0, 1, \dots, 10] that is initially empty. The hash table is maintained…2026 Set 1 Q27Consider the following C statements: [figure] Which of the following options is/are correct?