This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Branch and Bound”. 1. Branch and bound is a __________ a) problem solving technique b) data structure c) sorting algorithm d) type of tree 2. Which of the following is not a branch and bound strategy to generate branches? a) … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Best First Search”. 1. Is Best First Search a searching algorithm used in graphs. a) True b) False 2. Who described this Best First Search algorithm using heuristic evaluation rule? a) Judea Pearl b) Max Bezzel c) Franz Nauck d) … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Breadth First Search”. 1. Breadth First Search is equivalent to which of the traversal in the Binary Trees? a) Pre-order Traversal b) Post-order Traversal c) Level-order Traversal d) In-order Traversal 2. Time Complexity of Breadth First Search is? (V – number of … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Non-recursive Depth First Search”. 1. Which of the following data structure is used to implement DFS? a) linked list b) tree c) stack d) queue 2. Which of the following traversal in a binary tree is similar to depth first … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Depth First Search (DFS)”. 1. Depth First Search is equivalent to which of the traversal in the Binary Trees? a) Pre-order Traversal b) Post-order Traversal c) Level-order Traversal d) In-order Traversal 2. Time Complexity of DFS is? (V – number of vertices, … Read more
