All challenges
Multiple ChoiceIntermediate 30s

Branch and bound

Branch and bound:
Options
  1. 1Prunes search tree using bounds on optimal solution
  2. 2Is simple depth-first search without pruning bounds
  3. 3Is greedy selection without any backtracking step
  4. 4Is breadth-first search over all reachable nodes

Think you can answer under pressure?

Get matched and answer live questions in 3-minute 1v1 battles. Elo ranking, badge tiers and bragging rights on the line.

Play this in a 3-minute battle