Use app×
Ask a Question
Join Bloom Tuition
One on One Online Tuition
JEE MAIN 2025 Foundation Course
NEET 2025 Foundation Course
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE

The Breadth First Search (BFS) algorithm has been implemented using the queue data structure.

← Prev Question Next Question →
0 votes
385 views
in Computer by (67.8k points)
closed by

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?

(A) MNOPQR 

(B) NQMPOR 

(C) QMNROP 

(D) POQNMR

Play Quiz Game >

1 Answer

+1 vote
by (68.9k points)
selected by
 
Best answer

(D) POQNMR

BFS: Start at root (some arbitrary node of a graph, sometimes referred to as “search key”) and explore the neighbor nodes first, before and moving to the next level neighbors.

← Prev Question Next Question →

Find MCQs & Mock Test

  1. JEE Main 2025 Test Series
  2. NEET Test Series
  3. Class 12 Chapterwise MCQ Test
  4. Class 11 Chapterwise Practice Test
  5. Class 10 Chapterwise MCQ Test
  6. Class 9 Chapterwise MCQ Test
  7. Class 8 Chapterwise MCQ Test
  8. Class 7 Chapterwise MCQ Test

Related questions

0 votes
1 answer
Consider the following function implemented in C:
asked Aug 11, 2022 in Computer by AnkitNegi (67.8k points)

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

Categories

User Contribution to Sarthaks eConnect
Managed by Sarthaks Digitizing India
...