U4 AI

What are the two main types of search methods?

• Greedy-best and Uniform-cost

• A* and Heuristics

• Informed and Uninformed

• BFS and DFS

Which search strategy explores neighboring nodes at the same level?

• Depth-first search

• Uniform Cost Search

• Greedy Search

• Breadth-First Search

What is the main advantage of informed searches over uninformed searches?

• They are faster

• They are less efficient

• They are incomplete

• They are more complex

What is does the cost between nodes in problem formulation (graphs) refer to?

• The branching factor

• The distance

• The number of nodes

• The number of steps

Which search strategy starts from both ends to find an optimized solution?

• Depth-First Search

• Bidirectional Search

• A* Search

• Greedy Search

What does the A* Search algorithm combine to improve upon greedy search?

• Optimality and completeness

• Time and space complexity

• Depth and breadth

• Heuristic value and actual cost

Which search strategy follows a single path to the goal and backs up (stop) when it hits a dead end?

• Breadth-First Search

• A* Search

• Greedy Search

• Depth-First Search

What is the main difference between informed and uninformed searches?

• Informed searches have more knowledge about the domain

• Uninformed searches are optimal

• Informed searches are faster

• Uninformed searches are more complex

Which one is NOT a real-life application of the search strategies?

• Navigation in GPS

• Pathfinding in video games

• Route planning on map

• Book searching in a library

According to the lesson, which search type can considered the best overall?

• A*

• BFS

• DFS

• Bidirectional