Dark Mode

Recent questions tagged tree-search-algorithm

3 votes

1 answer

1

UGC NET CSE | Junet 2015 | Part 3 | Question: 58
Which of the following statements is true for Branch-and-Bound search? Underestimates of remaining distance may cause deviation from optimal path Overestimates can't cause right path to be overlooked Dynamic programming principle can be used to discard redundant partial paths All of the above

go_editor asked in Algorithms Aug 1, 2016

3.9k views

1 vote

1 answer

2

UGC NET CSE | September 2013 | Part 3 | Question: 2
$\alpha - \beta$ cutoffs are applied to Depth first search Best first search Minimax search Breadth first search

go_editor asked in Algorithms Jul 22, 2016

1.7k views

To see more, click for the full list of questions or popular tags.

Recent questions tagged tree-search-algorithm