Lec 2

Question 1

what is Depth-Limited-Search ?

Answer 1

1

Question 2

what is the complexity of Depth-Limited-Search ?

Answer 2

2

Question 3

what is iterative-Deeping-DFS?

Answer 3

3

Question 4

what is the complexity of iterative-Deeping-DFS?

Answer 4

4

Question 5

what is Best-First-Graph-Search?

Answer 5

5

Question 6

what is uniform cost search?

Answer 6

6

Question 7

how Best-First-Graph-Search is working ?

Answer 7

7

Question 8

what is the performance of Uniform cost search

Answer 8

8

Question 9

what is informed search ?

Answer 9

9

Question 10

what is Heurstic cost function ?

Answer 10

10

Question 11

what is Greedy best-first search ?

Answer 11

11

Question 12

what is the performance of Greedy best-first search?

Answer 12

12

Question 13

what is A*?

Answer 13

13

Question 14

what is the performance of A*?

Answer 14

14

Question 15

what is Admissible heuristic function?

Answer 15

15

Question 16

what is consistent heuristic function?

Answer 16

16

Question 17

prove the A* is optimal

Answer 17

17

Question 18

מה ניתן להגיד על הקשר בין שלמות לבין אופטימליות

Answer 18

אם אלגוריתם הוא אופטימלי אז הוא שלם

Question 19

מה ההבדל בין צומת שפותח לצומת שנוצר

Answer 19

the node in open list are the one that created but not developed , the nodes in closed list are the nodes that was developed( succ was applied)

Question 20

מה ההבדל בין חיפוש בעץ לחיפוש בגרף

Answer 20

חיפוש בעץ לא בודק אם המצב פותח בעבר,כתוצאה נוצרים כפילויות.

לעומת זאת חיפוש בגרף מחזיק רשימה של מצבים שביקר בהם ומונע ביקור חוזר.

Question 21

in what condition is uniform cost search is complete ?

Answer 21

if the cost function is non negative for every node