GoConqr hat ein neues Design! Sag uns, wie es dir gefällt.

Quiz

Branch and Bound

Vicente García D 9 Fragen Aktualisiert am 13 Mai 2016

Quiz starten

Dieses Quiz enthält Fragetypen, die sich im gewohnten Player öffnen.

Fragen in diesem Quiz (9)

  1. 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]
    1. Adepth-first search
    2. Bbreadth-first search
    3. Cin breadth-first search
    4. Din depth-first search
  2. 2With which technique we could use some type of prune to avoid developing bad known nodes?
    1. ABacktracking
    2. BBranch and bound
  3. 3If we only search for the first solution, and there are solution states near the root, the best choice is usually Backtracking
    1. ARichtig
    2. BFalsch
  4. 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)
    1. ARichtig
    2. BFalsch
  5. 5If you have to develop the whole tree, Backtracking is usually better than Branch and bound
    1. ARichtig
    2. BFalsch
  6. 6A branching algorithm makes more sense when the idea is to get the first solution and exit
    1. ARichtig
    2. BFalsch
  7. 7Which data structure would be most appropriate for Branch and bound (without branching function) using Java as the programming language?
    1. AArrayList
    2. BList
    3. CPriorityQueue
    4. DQueue
    5. ETreeSet
    6. FHashMap
    7. GStack
  8. 8Which data structure would be most appropriate for Branch and bound (with branching function) using Java as the programming language?
    1. AArrayList
    2. BList
    3. CPriorityQueue
    4. DQueue
    5. ETreeSet
    6. FHashMap
    7. GStack
  9. 9The pruning function prevents the development of certain states that do nothing to find the solution to the problem when they:
    1. ADo not lead to any solution
    2. BDo not lead to better solutions
    3. CAre repeated developments

Informationen

Beschreibung
Bachelor of Software Engineering - Algorithmics course - University of Oviedo
Sprache
English
Aufrufe
14
Verlauf
Erstellt am 31 Mär 2016 · aktualisiert am 13 Mai 2016
Schlagwörter
reviewalgorithmicsbranch and boundbachelors degree
Bewertung
Noch keine Bewertungen
Bewerte dieses Quiz
Bewerte dieses Quiz

Feedback

Worum geht es?

Wie gefällt dir das neue Design?

Dein Eindruck