GATE CS 2017 (Afternoon) — Question 15

AlgorithmsGraph Traversals (BFS, DFS) & Single-Source Shortest PathsMCQ1 mark · −1/3 if wrongMedium

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?
Question image
  1. A
    MNOPQR
  2. B
    NQMPOR
  3. C
    QMNROP
  4. D
    POQNMR
Practise the full 2017-AN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAPractise this subject in the exam simulatorTimed, GATE-style tests with analytics that find your weak topics.
Practise more on Graph Traversals (BFS, DFS) & Single-Source Shortest PathsTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group