AI

Frage zuerst
Antwort zuerst
Selbsttest

0.0 (0)

Lernen

Kartei Details

Karten	20
Sprache	Deutsch
Kategorie	Informatik
Stufe	Andere
Erstellt / Aktualisiert	18.06.2022 / 17.09.2022
Lizenzierung	Keine Angabe
Weblink	https://card2brain.ch/box/20220618_ai
Einbinden	<iframe src="https://card2brain.ch/box/20220618_ai/embed" width="780" height="150" scrolling="no" frameborder="0"></iframe>

Flip-Modus

Why are tree search algorithms incomplete?

Because state spaces can have an infinite number of states.

Because state spaces can have an infinite number of paths.

Because state spaces can have an infinite number of state transitions.

Because state spaces can have an infinite number of actions.

none of these

Which of the following are advantages of IDA* over A*?

It usually requires much less memory.

It usually requires far fewer node expansions.

It uses simpler data structures.

It is complete.

none of these

Which statements about heuristic search are correct?

All admissible heuristics can be computed efficiently.

If heuristic h is safe, then h(s) = ∞ holds for all unsolvable states s.

The point of heuristics is to direct a state-space search algorithm towards the goal.

Designing a good heuristic often involves a trade-off between computation time and quality of the heuristic estimate.

none of these

Which statements about hill climbing for combinatorial optimization are correct?

Hill climbing can return suboptimal solutions.

Hill climbing can fail on solvable problems.

Hill climbing can detect when a problem is unsolvable.

Hill climbing is very memory-efficient.

none of these

Which statements about inference methods for constraint satisfaction are correct?

Inference methods can be accelerated by using suitable variable ordering strategies in the BacktrackingWithInference algorithm.

Forward checking is a faster inference method than arc consistency.

Path consistency is a faster inference method than arc consistency.

All inferences made by forward checking are also made by arc consistency, but not vice versa.

none of these

NaiveBacktracking uses a form of depth-first search. Which of these are plausible reasons for using a form of breadth-first search instead within NaiveBacktracking?

Breadth-first search could find solutions with lower cost.

Breadth-first search could find solutions more quickly.

Breadth-first search would avoid problems with duplicates.

Breadth-first search would repair the problems that NaiveBacktracking has with unsolvable constraint networks.

none of these