chapter 3b

Question 1

what is searching?

Answer 1

Examine different possible sequences of actions & states, and come up with specific sequence of operators/actions that will take you from the initial state to the goal state.

Question 2

what is search tree?

Answer 2

is a representation in which nodes denote paths and branches connect paths.

Question 3

what are the two function needed for conducting search?

Answer 3

generator and tester function

Question 4

list algorithm evaluation?

Answer 4

completeness, optimality , time complexity and space complexity

Question 5

Searching Algorithms / strategies

Answer 5

Informed and Uninformed search

Question 6

what is breadth first search and implementation

Answer 6

Expand all nodes on a given level of the search tree before moving to the next level and FIFO

Question 7

average number of child nodes for a given node called

Answer 7

branch factor

Question 8

what is Depth-first search and implementation

Answer 8

Expand one of the node at the deepest level of the tree and LIFO

Question 9

in DFS This algorithm may not terminate and go on infinitely on one path so what kind of solution you are going to use

Answer 9

cut-off depth

Question 10

______is an operationally-effective piece of information on how to direct search in a problem space

Answer 10

Heuristic