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

Which data structure is most suitable for implementing best first branch and bound strategy?

← Prev Question Next Question →
0 votes
2.2k views
in Information Technology by (121k points)
closed by
Which data structure is most suitable for implementing best first branch and bound strategy?

(a) stack

(b) queue

(c) priority queue

(d) linked list
Play Quiz Game >

1 Answer

0 votes
by (120k points)
selected by
 
Best answer
Right answer is (c) priority queue

The best explanation: Priority Queue is the data structure is used for implementing best first branch and bound strategy. Dijkstra’s algorithm is an example of best first search algorithm.
← 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

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
...