B Given ABCD, BE is the bisector of ZABD and BF is the bisector of ZDBC....

Transcribed Image Text:

B Given ABCD, BE is the bisector of ZABD and BF is the bisector of ZDBC. Prove that if AB = BC then EF is parallel to AC. (Hint: Use the theorem on bisector of an interior angle and side-splitting lemma.) E Q- How do local search algorithms such as the hill-climbing algorithm, differ from systematic search algorithms such as A*? (Check all that apply.) 1. The path by which a solution is reached is irrelevant for algorithms like A*. 2. Local search algorithms tend to use less memory. 3. The path by which a solution is reached is irrelevant for local search algorithms. 4. Local searches are often better at finding solutions in extremely large search spaces. Q-What is the main disadvantage to the A* search? 1. It is very prone to yielding suboptimal solutions. 2. It requires too much memory and too much time. 3. It requires too much time to explore nodes. 4. It requires too much memory for storing nodes. B Given ABCD, BE is the bisector of ZABD and BF is the bisector of ZDBC. Prove that if AB = BC then EF is parallel to AC. (Hint: Use the theorem on bisector of an interior angle and side-splitting lemma.) E Q- How do local search algorithms such as the hill-climbing algorithm, differ from systematic search algorithms such as A*? (Check all that apply.) 1. The path by which a solution is reached is irrelevant for algorithms like A*. 2. Local search algorithms tend to use less memory. 3. The path by which a solution is reached is irrelevant for local search algorithms. 4. Local searches are often better at finding solutions in extremely large search spaces. Q-What is the main disadvantage to the A* search? 1. It is very prone to yielding suboptimal solutions. 2. It requires too much memory and too much time. 3. It requires too much time to explore nodes. 4. It requires too much memory for storing nodes.