Courses
Tutorials
- DSA
- Data Structures
- Algorithms
- Interview Corner
- Languages
  - C
  - C++
  - Java
  - Python
  - JavaScript
  - PHP
  - C#
  - SQL
  - Scala
  - Perl
  - Go Language
  - Kotlin
- Web Development
  - HTML
  - CSS
  - JavaScript
  - PHP
  - CSS Frameworks
  - JavaScript Frameworks
  - JavaScript Libraries
  - WordPress
  - JSON
- ML & Data Science
  - Machine Learning
  - Data Science
- CS Subjects
- GATE
- Software Designs
  - Software Design Patterns
  - System Design Tutorial
- GFG Sheets
  - Web Dev Cheat Sheets
  - Company-Wise SDE Sheets
  - DSA Sheets
- School Learning
  - School Programming
  - Mathematics
  - Maths Notes (Class 8-12)
  - NCERT Solutions
  - RD Sharma Solutions
  - Physics Notes (Class 8-11)
  - Chemistry Notes
  - Business Studies (Class 11th)
  - Business Studies (Class 12th)
  - Accountancy (Class 12th)
- CS Exams/PSUs
  - ISRO
  - UGC NET
- Student
- UPSC
- SSC CGL
- Banking Exams
Jobs
- Apply for Jobs
- Post a Job
  - Hire with Us
  - Know about Jobathon
- Jobathon
Practice
Contests

ISRO | ISRO CS 2017 – May | Question 17

Last Updated : 20 Mar, 2018

Which of the following data structure is useful in traversing a given graph by breadth first search?
(A) Stack
(B) List
(C) Queue
(D) None of the above.

Answer: (C)

Explanation: BFS performs level-order traversal which can be fairly done using a queue. A queue uses FIFO ordering and the nodes that we enqueue first are explored first maintaining the order of traversal.

Quiz of this Question