Quiz
Branch and Bound
This quiz has question types that open in the usual player.
Questions in this quiz (9)
1Working with Backtracking, the tree of states is developed in [blank_start]depth-first search[blank_end]. With branch and bound, the tree of states is developed [blank_start]in breadth-first search[blank_end]
- Adepth-first search
- Bbreadth-first search
- Cin breadth-first search
- Din depth-first search
2With which technique we could use some type of prune to avoid developing bad known nodes?
- ABacktracking
- BBranch and bound
3If we only search for the first solution, and there are solution states near the root, the best choice is usually Backtracking
- ATrue
- BFalse
4With backtracking (depth-first) it is possible to enter a branch with many nodes that do not reach any solution or even that has no end (infinite)
- ATrue
- BFalse
5If you have to develop the whole tree, Backtracking is usually better than Branch and bound
- ATrue
- BFalse
6A branching algorithm makes more sense when the idea is to get the first solution and exit
- ATrue
- BFalse
7Which data structure would be most appropriate for Branch and bound (without branching function) using Java as the programming language?
- AArrayList
- BList
- CPriorityQueue
- DQueue
- ETreeSet
- FHashMap
- GStack
8Which data structure would be most appropriate for Branch and bound (with branching function) using Java as the programming language?
- AArrayList
- BList
- CPriorityQueue
- DQueue
- ETreeSet
- FHashMap
- GStack
9The pruning function prevents the development of certain states that do nothing to find the solution to the problem when they:
- ADo not lead to any solution
- BDo not lead to better solutions
- CAre repeated developments
Information
- Description
- Bachelor of Software Engineering - Algorithmics course - University of Oviedo
- Author
- Vicente García D
- Language
- English
- Views
- 14
- History
- Created on 31 Mar 2016 · updated on 13 May 2016
- Tags
- Rating
- No ratings yet Rate this quiz